Submission #1272875

#TimeUsernameProblemLanguageResultExecution timeMemory
1272875goulthenFeast (NOI19_feast)C++20
21 / 100
1096 ms17892 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define rep(i,a,b) for(int i = a; i <= b; i++) #define per(i,a,b) for(int i = a; i >= b; i--) #define pii pair<int,int> #define pb push_back #define fi first #define se second const int MAXN = 2e3+10; const int INF = 1e18+10; int dp[MAXN][MAXN], a[MAXN]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); int n,k;cin >> n >> k; rep(i,1,n) cin >> a[i]; rep(i,1,n) { rep(j,1,k) { dp[i][j] = dp[i-1][j]; int s = 0; per(l,i,1) { s+=a[l]; dp[i][j] = max(dp[i][j], dp[l-1][j-1] + s); } } } cout << dp[n][k] << '\n'; 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...