#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
using namespace std;
const int mxN = 1e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 4000;
const int LOG = 50;
const int block = 700;
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
if (a < b) {a = b; return true;} return false;
}
struct Line{
ll m, c;
int idx;
ll eval(ll x) {return 1LL * m * x + c;}
long double intersectX(Line l)
{
return (long double) (l.c - c) / (long double) (m - l.m);
}
};
int n;
int k;
int a[mxN];
int pre[mxN];
int trace[207][mxN];
ll dp[2][mxN];
deque<Line> dq;
vector<int> ans;
// ax + y
void solve()
{
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];
memset(dp, -0x3f, sizeof(dp));
ll oo = dp[0][0];
for(int i = 1; i <= n; i++) dp[0][i] = 0;
for(int i = 1; i <= k; i++) {
dq.clear();
for(int j = 0; j <= n; j++) dp[i & 1][j] = oo;
for(int j = 1; j <= n; j++) {
Line newline = {pre[j - 1], dp[(i - 1) & 1][j - 1] - 1LL * pre[j - 1] * pre[j - 1], j - 1};
while(sz(dq) >= 2 && dq.back().intersectX(newline) <= dq[sz(dq) - 2].intersectX(newline)) dq.pop_back();
dq.push_back(newline);
//lc.add(pre[j - 1], dp[(i - 1) & 1][j - 1] - 1LL * pre[j - 1] * pre[j - 1], j - 1);
while(sz(dq) >= 2 && dq[0].eval(pre[j]) <= dq[1].eval(pre[j])) dq.pop_front();
pair<ll, int> tmp = {dq[0].eval(pre[j]), dq[0].idx};
if(maximize(dp[i & 1][j], tmp.fi) == true) {
trace[i][j] = tmp.se;
}
}
}
cout << dp[k & 1][n] << endl;
int x = k;
int y = n;
while(x > 0) {
int tmp = trace[x][y];
if(y != n) ans.pb(y);
--x;
y = tmp;
}
ans.pb(y);
reverse(all(ans));
for(auto it : ans) cout << it << ' ';
}
// dp[i][k] = dp[j][k - 1] + (pre[i] - pre[j]) * pre[j]
// dp[i][k] = dp[j][k - 1] - pre[j] ^ 2 + pre[i] * pre[j]
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("task.inp", "r", stdin);
//freopen("task.out", "w", stdout);
int tc = 1;
//cin >> tc;
while(tc--) {
solve();
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1864 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
2132 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
1992 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1872 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
2900 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
1864 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
2644 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
2900 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
2900 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
2132 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
2132 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
3540 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
3668 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
3284 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
3664 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
3540 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
2260 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
2516 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2156 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
2260 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
60 ms |
10828 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
2260 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
47 ms |
7408 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
52 ms |
8204 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
52 ms |
8644 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
40 ms |
7452 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
51 ms |
8208 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
59 ms |
9916 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
4876 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
17 ms |
4808 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
556 ms |
82280 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
16 ms |
5288 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
751 ms |
82064 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
521 ms |
58724 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
550 ms |
62916 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
396 ms |
51796 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
460 ms |
58820 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
578 ms |
74596 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
