Submission #243735

#TimeUsernameProblemLanguageResultExecution timeMemory
243735islingrSplit the sequence (APIO14_sequence)C++14
28 / 100
2084 ms5140 KiB
#include <iostream> using namespace std; template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } const int N = 1e5 + 5, K = 205; int64_t f[K][N], a[N], inf = 1e18; int opt[K][N], st[N]; signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; for (int i = 1; i <= n; ++i) cin >> a[i], a[i] += a[i - 1]; f[0][0] = -inf; for (int l = 1; l <= k; ++l) for (int i = 1; i <= n; ++i) for (int j = 1; j <= i; ++j) if (ckmax(f[l][i], f[l - 1][j] + a[j] * (a[i] - a[j]))) opt[l][i] = j; cout << f[k][n] << '\n'; for (int v = n, l = k; v = opt[l--][v]; ) st[l] = v; for (int i = 0; i < k; ++i) cout << st[i] << ' '; }

Compilation message (stderr)

sequence.cpp: In function 'int main()':
sequence.cpp:26:27: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  for (int v = n, l = k; v = opt[l--][v]; ) st[l] = v;
                         ~~^~~~~~~~~~~~~
#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...