Submission #647608

#TimeUsernameProblemLanguageResultExecution timeMemory
647608billyismeFeast (NOI19_feast)C++14
21 / 100
1047 ms16300 KiB
#include<bits/stdc++.h> using namespace std ; #define ll long long #define pb push_back #define pk pop_back #define pii pair<int,int> #define X first #define Y second const int N =2e3+5 , oo = 1e9 ; const ll inf = 1e17 , cs = 330 , sm = 1e9+7 ; int n , k ; ll a[N] ,s[N] ; ll f[N][N] ; ll res=0 ; ll ma[N][N] ; void inp() { cin>> n >> k ; for(int i=1;i<=n;i++) { cin>>a[i] ; s[i] =s[i-1]+a[i] ; } } void solve() { for(int i=1 ;i<=n;i++) { for(int j= 1;j<=k;j++) { for(int t= 1;t<=i;t++) { f[i][j] =max(f[i][j],s[i]-s[t-1]+ma[t-1][j-1]); ma[i][j] = max(ma[i-1][j],f[i][j]); res=max(res,f[i][j]) ; } } } cout<<res; } int main() { ios_base::sync_with_stdio(0); cin.tie(0) ; cout.tie(0) ; int t = 1; while(t--) { inp() ; solve() ; } }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...