Submission #1150267

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
#define rep(i, a, n) for(int i=a; i<n; i++)

int main() {
	int N;
	int a[101][101];
	int dp[101][101];
	
	cin >> N;
	rep(i, 0, N){
		rep(j, 0, i+1){
			cin >> a[i][j];
		}
	}
	
	int ret=0;
	rep(i, 0, N){
		rep(j, 0, i+1){
			if(i!=0 && j!=0) dp[i][j]=max(dp[i][j], dp[i-1][j-1]);
			if(i!=0) dp[i][j]=max(dp[i][j], dp[i-1][j]);
			dp[i][j]+=a[i][j];
			ret=max(ret, dp[i][j]);
		}
	}
	
	cout << ret << endl;
	
	return 0;
}

Submission Info

Judge Result