1 solutions
-
0
#include<bits/stdc++.h> using namespace std; long long dp[1005][1005],a[1005][1005],n; 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=1;i<=n;i++){ dp[n][i]=a[n][i]; } for(int i=n-1;i>=1;i--){ for(int j=1;j<=i;j++){ dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+a[i][j]; } } cout<<dp[1][1]<<endl; return 0; }
- 1
Information
- ID
- 216
- Time
- 1000ms
- Memory
- 125MiB
- Difficulty
- 2
- Tags
- # Submissions
- 23
- Accepted
- 16
- Uploaded By