Submission #1270770

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;

int N;
int a[110][110];
int dp[110][110];

int main()
{
	cin >> N;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= i; j++) {
			cin >> a[i][j];
		}
	}

	int ans = 0;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= i; j++) {
			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];
			ans = max(ans,dp[i][j]);
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result