Contest2949 - [C3]第三节课-递推2

#include<bits/stdc++.h>
using namespace std;
long long n,m,a[1000][1000];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=i;j++) cin>>a[i][j];
	}
	for(int i=n;i>=1;i--){
		for(int j=1;j<=i;j++) a[i][j]+=max(a[i+1][j],a[i+1][j+1]);
	}
	int arr[111];
	for(int i = 1, j = 1; i <= n; i ++){
		if(a[i+1][j] > a[i+1][j+1]){
		} else {
			j ++;
		}
		arr[i] = j;
	}
	for(int i = n; i >= 1; i --){
		if(i != n) cout << "->" << i << "," << arr[i];
		else cout << i << "," << arr[i];
	}
}