Submission #344882

#TimeUsernameProblemLanguageResultExecution timeMemory
344882spike1236Split the sequence (APIO14_sequence)C++14
71 / 100
2061 ms89468 KiB
#include <bits/stdc++.h> const int MAXN = 1e5 + 10; int64_t pref[MAXN]; int64_t dp[MAXN][2]; int opt[MAXN][220]; int n, K; void calc(int k, int l, int r, int optl, int optr) { if(l > r) return; int m = l + r >> 1; int64_t res = -1e18; opt[m][k] = optl; for(int i = optl; i <= std::min(m - 1, optr); ++i) { int64_t cur = dp[i][(k & 1) ^ 1] + pref[i] * (pref[m] - pref[i]); if(cur > res) { res = cur; opt[m][k] = i; } } dp[m][k & 1] = res; calc(k, l, m - 1, optl, opt[m][k]); calc(k, m + 1, r, opt[m][k], optr); } void solve() { std::cin >> n >> K; for(int i = 1; i <= n; ++i) { int64_t x; std::cin >> x; pref[i] = pref[i - 1] + x; } for(int i = 1; i <= K; ++i) calc(i, i + 1, n, i, n); std::vector <int> ans; int pos = n; for(int i = K; i > 0; --i) pos = opt[pos][i], ans.push_back(pos); reverse(ans.begin(), ans.end()); std::cout << dp[n][K & 1] << '\n'; for(auto it : ans) std::cout << it << ' '; } int main() { std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0); solve(); return 0; } /** 7 3 4 1 3 4 0 2 3 */

Compilation message (stderr)

sequence.cpp: In function 'void calc(int, int, int, int, int)':
sequence.cpp:11:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   11 |     int m = l + r >> 1;
      |             ~~^~~
#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...