Submission #1209998

#TimeUsernameProblemLanguageResultExecution timeMemory
1209998blazerFeast (NOI19_feast)C++20
59 / 100
1094 ms7456 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N, K; cin >> N >> K; vector<ll> A(N); for (int i = 0; i < N; ++i) cin >> A[i]; vector<ll> dp(N + 1, 0); for (int k = 1; k <= K; ++k) { vector<ll> new_dp(N + 1, 0); ll max_diff = LLONG_MIN; ll prefix = 0; for (int i = 1; i <= N; ++i) { prefix += A[i - 1]; max_diff = max(max_diff, dp[i - 1] - prefix + A[i - 1]); new_dp[i] = max(new_dp[i - 1], max_diff + prefix); } dp.swap(new_dp); } cout << dp[N] << '\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...