View Code of Problem 288

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
int arr[105][105];
int main(void){
	int n;
	while(cin>>n){
		memset(arr,0,sizeof(arr));
		for(int i=0;i<n;i++){ 
			for(int j=0;j<=i;j++){
				cin>>arr[i][j];
			}
		}
		for(int i=n-2;i>=0;i--){
			for(int j=0;j<=i;j++){
				arr[i][j]=max(arr[i+1][j],arr[i+1][j+1])+arr[i][j];
			}
		}
		cout<<arr[0][0]<<endl;
	}
	
}

Double click to view unformatted code.


Back to problem 288