Submission #1200634

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<functional>
#include<map>
#include<cstring>
#include<unordered_map>
#include<set>
#include<string.h>
using namespace std;

int a[100][100];
int dp[100][100];
signed main() {
	int b; cin >> b;
	for (int c = 1; c <= b; c++) {
		for (int d = 0; d < c; d++) {
			cin >> a[c - 1][d];
		}
	}
	dp[0][0] = a[0][0];
	for (int c = 1; c < b; c++) {
		dp[c][0] = dp[c - 1][0] + a[c][0];
		for (int j = 1; j <= c; j++) {
			dp[c][j] = max(dp[c - 1][j - 1], dp[c - 1][j]) + a[c][j];
		}
	}
	cout << *max_element(dp[b-1], dp[b-1] + 100) << endl;
}

Submission Info

Judge Result