ამ გვერდზე თქვენ იხილავთ გაგზავნილი ამოხსნების სტატუსს.
გაგზავნის თარიღი: 23.02.2019 15:27:56
ამოცანა: ბოულინგი
მომხმარებელი: Dachi
ვერდიქტი: სრული ამოხსნა
შეფასება: 100.0 ქულა
#include <bits/stdc++.h>
using namespace std;
int n,i,j,k,a[400][400];
int main()
{
cin>>n;
for (i=1;i<=n;i++)
for (j=1;j<=i;j++)
cin>>a[i][j];
k=n-1;
for (i=n-1;i>=1;i--)
{
for (j=1;j<=k;j++)
a[i][j]+=max(a[i+1][j],a[i+1][j+1]);
k--;
}
cout<<a[1][1]<<endl;
}
5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
30
30
YES
110 3 2 10 5 2 5 6 8 6 7 3 7 3 9 9 10 2 3 10 4 2 8 1 1 8 5 10 1 10 5 5 5 5 6 5 10 1 9 4 6 2 5 10 4 1 8 2 5 7 10 10 7 9 4 5 8 7 3 2 9 2 10 1 7 7 9 10 7 6 10 9 4 10 10 7 4 10 10 3 8 8 3 5 10 2 1 4 9 9 3 10 8 5 2 2 8 1 9 4 8 6 6 3 4 9 7 5 7 5 2 10 9 4 3 5 6 1...
872
872
YES
2 1 2 3
4
4
YES
1 0
0
0
YES
10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 99
108
108
YES
15 46 30 82 90 56 17 95 15 48 26 4 58 71 79 92 60 12 21 63 47 19 41 90 85 14 9 52 71 79 16 81 51 95 93 34 10 79 95 61 92 89 88 66 64 92 63 66 64 39 51 27 0 95 12 8 66 47 42 74 69 89 83 66 41 90 78 65 79 90 33 53 29 85 22 33 37 36 68 60 58 36 60 42 42 67 15...
1066
1066
YES
199 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 ...
199
199
YES
150 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
1
1
YES
349 97 0 81 18 39 69 8 80 34 28 8 31 29 22 28 16 2 36 95 66 5 37 29 67 13 16 89 27 86 26 65 49 25 13 22 50 98 31 96 24 30 48 87 92 32 38 93 42 67 36 72 2 28 90 75 45 97 75 6 75 15 77 86 78 87 46 57 8 68 16 10 75 56 76 68 22 22 18 19 36 40 9 20 93 4 48 65 9...
25686
25686
YES
50 6 10 10 10 6 5 9 7 5 10 2 1 10 1 3 9 8 9 6 7 8 3 7 3 4 8 4 10 4 4 4 2 10 7 5 1 7 6 10 2 8 7 9 2 4 9 9 8 7 2 10 7 6 2 9 5 3 1 4 9 8 5 8 5 10 6 1 10 2 3 5 8 2 3 5 2 6 9 1 7 8 5 1 7 8 9 8 5 1 10 2 6 9 10 5 10 3 10 6 9 3 6 10 9 8 2 5 6 10 5 9 7 5 9 7 8 4 6 ...
402
402
YES