#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class A> ostream& operator<<(ostream &cout, vector<A> const &v) {cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";};
template<class A, class B> ostream& operator<<(ostream &cout, const pair<A,B> &x) {return cout << "(" <<x.first << ", " << x.second << ")";};
template <class T> void pv(T a, T b) {cerr << "["; for (T i = a; i != b; ++i) cerr << *i << " "; cerr << "]\n";}
void _print() {cerr << "]\n";}
template <class T, class... V> void _print(T t, V... v) {cerr << t; if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#define fi first
#define se second
#define SZ(x) (int)((x).size())
#define pii pair<int,int>
typedef long double ld;
const int mx = 1e5+5;
struct line {
int idx;
ll m, b;
line(ll mm, ll bb, int ii) : idx(ii), m(mm), b(bb) {}
ll eval(ll x) {return m*x+b;}
ld isectx(line l) {return (ld)(l.b-b)/(m-l.m);}
};
ll a[mx];
int prv[mx][205];
deque<line> stuff[205];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n,k;
cin >> n >> k;
for (int q = 1; q <= n; q++) cin >> a[q];
stuff[0].push_back(line(0,0,0));
ll cur = 0, ans = 0;
for (int q = 1; q <= n; q++) {
cur += a[q];
for (int w = min(q,k+1); w >= 1; w--) {
while (SZ(stuff[w-1]) >= 2 && stuff[w-1][0].eval(cur) >= stuff[w-1][1].eval(cur)) stuff[w-1].pop_front();
ll val = stuff[w-1][0].eval(cur)+cur*cur;
if (q == n && w == k+1) ans = val;
prv[q][w] = stuff[w-1][0].idx;
if (w > 1) assert(prv[q][w] != 0);
line ins = line(cur*-2,val+cur*cur,q);
while (SZ(stuff[w])) {
if (stuff[w].back().m == ins.m) {
if (ins.b < stuff[w].back().b) stuff[w].pop_back();
else break;
} else if (SZ(stuff[w]) >= 2) {
if (ins.isectx(stuff[w].back()) <= ins.isectx(stuff[w][SZ(stuff[w])-2])) stuff[w].pop_back();
else break;
} else {
break;
}
}
if (SZ(stuff[w]) == 0 || stuff[w].back().m != ins.m) stuff[w].push_back(ins);
}
}
cout << (cur*cur-ans)/2 << "\n";
int ri = n, cuts = k+1;
while (cuts > 1) {
cout << prv[ri][cuts] << " ";
ri = prv[ri][cuts];
cuts--;
}
cout << "\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
492 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
492 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1388 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
1388 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
1388 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
1516 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1388 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
1388 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
1772 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
1388 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
1388 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
8940 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
8 ms |
9196 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
99 ms |
10092 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
8 ms |
9068 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
58 ms |
9964 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
66 ms |
9452 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
84 ms |
9964 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
72 ms |
10220 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
72 ms |
9836 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
91 ms |
9836 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
69 ms |
85612 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
68 ms |
85868 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1179 ms |
96628 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
72 ms |
87148 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1094 ms |
94700 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
815 ms |
89936 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
978 ms |
95572 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
789 ms |
94316 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
776 ms |
94316 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1016 ms |
94840 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
