Submission #1272878

#TimeUsernameProblemLanguageResultExecution timeMemory
1272878goulthenFeast (NOI19_feast)C++20
28 / 100
1095 ms7388 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 = 3e5+10; const int INF = 1e18+10; int dp[MAXN][2], 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(j,1,k) { int mx = 0; rep(i,1,n) { dp[i][j] = dp[i-1][j]; mx+=a[i]; mx = max(mx, dp[i-1][j-1] + a[i]); dp[i][j] = max(dp[i][j], mx); } } 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...