Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <string>
- using namespace std;
- int main()
- {
- int n,a[100][100],sum[100][100],row[100];
- cin >> n;
- for (int i=0;i<n;i++)
- {
- cin >> a[i][i];
- sum[i][i]=a[i][i];
- row[i]=a[i][i];
- }
- for (int j=1;j<n;j++) {
- for (int l=0;l<n-j;l++){
- sum[j+l][l]=sum[j+l-1][l]+row[j+l];
- a[j+l][l]=sum[j+l][l]-min(a[j+l-1][l],a[j+l][l+1]);
- }
- }
- if (min(a[n-2][0],a[n-1][1])==a[n-1][0]) cout << '0';
- else if (min(a[n-2][0],a[n-1][1])>a[n-1][0]) cout << '2';
- else cout << '1';
- }
Add Comment
Please, Sign In to add comment