# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37565 | mirbek01 | 수열 (APIO14_sequence) | C++14 | 9 ms | 82488 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# include <bits/stdc++.h>
# define pb push_back
# define fr first
# define sc second
# define mk make_pair
using namespace std;
const int inf = 1e9 + 7;
const int N = 1e5 + 5;
typedef long long ll;
int n, k, p[201][N], pref[N];
ll dp[2][N];
ll get(int l, int r)
{
return pref[l] * 1ll * (pref[r] - pref[l]);
}
void dv(int k, int l, int r, int opl, int opr)
{
if(l > r) return ;
int md = (l + r) >> 1, kk = 1 - (k % 2);
p[md][k] = opl;
for(int i = opl; i <= min(md - 1, opr); i ++)
{
ll now = dp[kk][i] + get(i, md);
if(dp[k % 2][md] < now)
{
dp[k % 2][md] = now;
p[k][md] = i;
}
}
dv(k, l, md - 1, opl, p[k][md]);
dv(k, md + 1, r, p[k][md], opr);
}
int main()
{
scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i ++)
{
scanf("%d", &pref[i]);
pref[i] += pref[i - 1];
}
for(int i = 1; i <= k; i ++)
dv(i, i, n, i, n);
printf("%d\n", dp[k % 2][n]);
for(int i = k; i >= 1; i --)
{
printf("%d ", p[i][n]);
n = p[i][n];
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |