fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
  5. #define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
  6. #define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
  7. #define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
  8. #define SZ(S) ((int) ((S).size()))
  9.  
  10. #define DEBUG(x) { cout << #x << " = " << x << endl; }
  11. #define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
  12. #define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
  13.  
  14. int n, a[1011][1011], sum[1011][1011], f[1011][1011];
  15.  
  16. int main() {
  17.     ios :: sync_with_stdio(false); cin.tie(NULL);
  18.     cout << (fixed) << setprecision(6);
  19.     while (cin >> n && n) {
  20.         FOR(i,1,n) FOR(j,1,i) {
  21.             cin >> a[i][j];
  22.         }
  23.         FOR(j,1,n) FOR(i,j,n) {
  24.             int ii = i - j + 1;
  25.             sum[j][ii] = sum[j][ii-1] + a[i][j];
  26.         }
  27.         memset(f, 0, sizeof f);
  28.         FOR(j,1,n) {
  29.             int ln = n - j + 1;
  30.             FORD(k,ln,0) {
  31.                 f[j][k] = f[j-1][k] + sum[j][k];
  32.                 if (k < ln) f[j][k] = max(f[j][k], f[j][k+1]);
  33.             }
  34. //            PR0(f[j], ln+1);
  35.         }
  36.         cout << f[n][0] << endl;
  37.     }
  38.     return 0;
  39. }
  40.  
  41.  
Success #stdin #stdout 0s 15456KB
comments (?)
stdin
copy 
4
3
-5 3
-8 2 -8
3 9 -2 7
2
-2
1 -10
3
1
-5 3
6 -4 1
0
stdout
copy 
7
0
6
https://ideone.com/QPsSqd
language:
C++14 (gcc 8.3)
created:
9 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!