//Suleyman Atayew
#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <bitset>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#define N 100010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mod 1000000007
#define pii pair <ll, ll>
#define sz(a) (ll)(a.size())
ll bigmod(ll a, ll b) { if(b==0)return 1; ll ret = bigmod(a, b/2); return ret * ret % mod * (b%2 ? a : 1) % mod; }
using namespace std;
ll n, k;
ll v[N], p[N], dp[N][5];
int pr[N][210];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for(ll i = 1; i <= n; i++)
cin >> v[i], p[i] = p[i-1] + v[i];
int tp = 0;
for(ll i = 1; i <= k; i++) {
ll in = i;
for(ll h = i+1; h <= n; h++) {
while(in < h && (p[h] - p[in-1]) * p[in-1] + dp[in-1][!tp] <= (p[h] - p[in]) * p[in] + dp[in][!tp])
in++;
dp[h][tp] = (p[h] - p[in-1]) * p[in-1] + dp[in-1][!tp];
pr[h][i] = in-1;
}
tp = !tp;
}
cout << dp[n][!tp] << "\n";
ll x = n, y = k;
while(y > 0) {
cout << pr[x][y] << " ";
x = pr[x][y], y--;
}
}
/*
7 6
4 1 3 4 0 2 3
2 1
100 100
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 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 |
1 ms |
332 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 |
332 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 |
1 ms |
332 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 |
1 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 |
1 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 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 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 |
332 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
2 ms |
1100 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
4 ms |
1100 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Incorrect |
2 ms |
1100 KB |
contestant didn't find the optimal answer: 4698976842 < 4699030287 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
9036 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
5 ms |
9036 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
24 ms |
9072 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
5 ms |
9036 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
22 ms |
9108 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Incorrect |
22 ms |
9112 KB |
contestant didn't find the optimal answer: 514785562499 < 514790755404 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
46 ms |
87908 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
50 ms |
88136 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
408 ms |
88476 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
51 ms |
88452 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
453 ms |
88164 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
306 ms |
88164 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
317 ms |
88448 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
231 ms |
88340 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
266 ms |
88316 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
371 ms |
88320 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |