#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define sp " "
#define debug(x) cout << #x << " => " << x << "\n"
const int mod = 1e9 + 7;
const ld err = 1e-6;
int n, k;
int dp[100005], ne[100005], arr[100005], p[100005];
int backtrack[205][100005];
int aqua;
vector <int> ans;
struct line{
int m, c, idx;
int f(int x){
return m * x + c;
}
ld intersect(line l){
return (ld) (c - l.c) / (l.m - m);
}
};
void solve(){
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> arr[i];
p[i] = p[i - 1] + arr[i];
}
fill(dp, dp + n + 1, 0);
for(int i = 0; i <= k; i++){
deque <line> dq;
dq.push_front({-p[i], dp[i], i});
for(int j = i + 1; j <= n; j++){
while(dq.size() > 1 && dq.back().f(p[n] - p[j]) <= dq[dq.size() - 2].f(p[n] - p[j]))
dq.pop_back();
ne[j] = p[j] * (p[n] - p[j]) + dq.back().f(p[n] - p[j]);
backtrack[i][j] = dq.back().idx;
line cur = {-p[j], dp[j], j};
while(dq.size() > 1 && cur.intersect(dq[0]) >= dq[0].intersect(dq[1]))
dq.pop_front();
dq.push_front(cur);
}
for(int j = i + 1; j <= n; j++){
dp[j] = ne[j];
ne[j] = 0;
}
}
cout << dp[n] << "\n";
aqua = n;
for(int i = k; i >= 1; i--){
aqua = backtrack[i][aqua];
ans.push_back(aqua);
}
for(int i = ans.size() - 1; i >= 0; i--)
cout << ans[i] << " ";
cout << "\n";
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
324 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
0 ms |
324 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
0 ms |
324 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
0 ms |
320 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
448 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
1484 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
1228 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
1484 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
1608 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
576 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
456 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
716 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
316 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
6 ms |
2900 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
7 ms |
2876 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Incorrect |
6 ms |
2508 KB |
contestant didn't find the optimal answer: 4699030135 < 4699030287 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1100 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
1224 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
56 ms |
17424 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
2 ms |
1100 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
47 ms |
10728 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Incorrect |
50 ms |
12480 KB |
contestant didn't find the optimal answer: 514786325281 < 514790755404 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
7400 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
20 ms |
7492 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Runtime error |
461 ms |
131076 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |