2 solutions
-
0
#include<bits/stdc++.h> using namespace std; int N=11; char a[n][N],f[N][n]; int main() { int n; cin>>n; memsat(f,-0x3f,sizeof f); for(int i=1;i<=n;i++) { for(int j=2;j<=i;j++) { cin>>a[j][i]; } } f[0][0]=0; for(int i=1;i<=n;i++) { for(int j=i;j<=n;j++) { f[i][j]=min(f[i][j-1],f[i-1][j-1])+a[i+1][j+1]; } } int res=-1e9; for(int i=j;i<n;i++) { res=max(res,f[N][n]); } cout<<N; return 0; }
Information
- ID
- 973
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- (None)
- # Submissions
- 36
- Accepted
- 21
- Uploaded By