#include <stdio.h>
#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
#define pp pop_back
#define sz(a) (int)(a.size())
#define mp make_pair
#define F first
#define S second
#define next _next
#define prev _prev
#define left _left
#define right _right
#define y1 _y1
#define all(x) x.begin(), x.end()
#define what_is(x) #x << " is " << (x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = (int)1e5 + 2;
const ll INF = (ll)1e18 + 123;
const int inf = (int)1e9 + 123;
const int MOD = (int)1e9 + 7;
const double eps = 1e-9;
void megaRandom() {
unsigned int FOR;
asm("rdtsc" : "=A"(FOR));
srand(FOR);
}
struct line {
ll k, b, ind;
};
ld intersection(line a, line z) {
if(a.k == z.k)
assert(0);
return 1.0 * (z.b - a.b) / (a.k - z.k);
}
vector<line> what;
void add(line a) {
while(sz(what) > 0 && what.back().k == a.k)
what.pp();
while(sz(what) > 1 && intersection(what[sz(what) - 2], a) + eps < intersection(what[sz(what) - 2], what.back()))
what.pp();
what.pb(a);
}
int n, k;
int a[N];
ll now[N], prev[N];
int pref[N];
int pr[202][N];
int main() {
megaRandom();
//freopen("check.in", "r", stdin);
cin >> n >> k;
k ++;
for(int i = 1; i <= n; i ++) {
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
int jt;
for(int it = 1; it <= k; it ++) {
memset(now, 0, sizeof now);
what.clear();
jt = 0;
if(it > 1) {
for(int i = 1; i <= n; i ++) {
ll val = 0;
while(jt + 1 < sz(what) && intersection(what[jt], what[jt + 1]) + eps < 1.0 * pref[i])
jt ++;
int j = i - 1;
if(jt < sz(what))
j = what[jt].ind;
j = max(j, it - 1);
//if(j != i - 1 && j == 0)
//assert(0);
//assert(j <= i);
now[i] = prev[j] + 1ll * pref[j] * (pref[i] - pref[j]);
pr[it][i] = j;
//cout << "it: " << it << " dp[i]: " << now[i] << " i: " << i << " j: " << j << "\n";
add({pref[i], prev[i] - (1ll * pref[i] * pref[i]), i});
}
}
for(int i = 1; i <= n; i ++)
prev[i] = now[i];
}
cout << prev[n] << "\n";
int x = k, y = n;
vector<int> g;
while(x > 1) {
//if(y == 1)
//assert(0);
g.pb(pr[x][y]);
y = pr[x][y], x --;
}
reverse(all(g));
for(int i = 0; i < sz(g); i ++)
cout << g[i] << ' ';
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:81:8: warning: unused variable 'val' [-Wunused-variable]
ll val = 0;
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1144 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
1144 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
3 ms |
1172 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
1172 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
1244 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
1244 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
1256 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
1256 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
1256 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
1328 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
1344 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
1344 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
1344 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
1344 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
1348 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
1424 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
1424 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1424 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
3 ms |
1424 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
4 ms |
1644 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
1644 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
3 ms |
1644 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
3 ms |
1644 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
4 ms |
1644 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
1644 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
1644 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
1644 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1644 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
1644 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
11 ms |
2412 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
2412 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
9 ms |
2412 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
11 ms |
2412 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
11 ms |
2412 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
4 ms |
2412 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
2412 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
2412 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2412 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
2412 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
18 ms |
3180 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
3180 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
18 ms |
3180 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
17 ms |
3180 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
19 ms |
3180 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
16 ms |
3180 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
5 ms |
3180 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
9 ms |
3180 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
3180 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
3180 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
116 ms |
10592 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
10592 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
60 ms |
10592 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
63 ms |
10592 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
76 ms |
10592 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
69 ms |
10592 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
64 ms |
10592 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
73 ms |
10592 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
35 ms |
10592 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
34 ms |
10592 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
614 ms |
83936 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
46 ms |
83936 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
936 ms |
83936 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
578 ms |
83936 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
680 ms |
83936 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
474 ms |
83936 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
487 ms |
83936 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
632 ms |
83936 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
