Submission #1550975

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"

using namespace std;

const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const long double PI = 3.1415926535897932384626433;

long long int N, M, K, L, R, H, W;



int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N;
	int dp[100][100] = {};
	int num[100][100] = {};
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= i; j++) {
			cin >> num[i][j];
		}
	}
	dp[0][0] = num[0][0];
	int ans = num[0][0];
	for (int i = 1; i < N; i++) {
		dp[i][0] = dp[i - 1][0] + num[i][0];
		for (int j = 1; j <= i; j++) {
			dp[i][j] = max(dp[i - 1][j - 1], dp[i - 1][j]) + num[i][j];
			ans = max(dp[i][j], ans);
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result