Submission #338804

#TimeUsernameProblemLanguageResultExecution timeMemory
338804nandonathanielBigger segments (IZhO19_segments)C++14
27 / 100
67 ms5100 KiB
#include<bits/stdc++.h> using namespace std; const int MAXN=505; long long dp[MAXN][MAXN]; int a[MAXN]; int main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int n; cin >> n; for(int i=1;i<=n;i++)cin >> a[i]; memset(dp,-1,sizeof(dp)); dp[0][0]=0; for(int i=1;i<=n;i++){ for(int j=1;j<=i;j++){ long long run=a[i]; for(int k=i-1;k>=0;k--){ if(dp[k][j-1]!=-1 && dp[k][j-1]<=run){ dp[i][j]=run; break; } run+=a[k]; } } } for(int j=n;j>=1;j--){ if(dp[n][j]!=-1){ cout << j << '\n'; break; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...