//Sasayego! Sasayego! Shinzou wo Sasageyo!
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <numeric>
#include <bitset>
#include <ctime>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
const int maxN = 1e5 + 5;
const int maxK = 2e2 + 5;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
int level, eren[maxK][maxN];
ll a[maxN], arumin[2][maxN];
vector <int> vec;
ll cost(int lt, int rt){
ll tmp = a[rt] - a[lt - 1];
return tmp * tmp;
}
void DC(int l, int r, int s, int e){
if (r < l)
return;
int md = (l + r) >> 1;
bool b = level % 2;
for (int i = s; i <= min(md, e); i++)
if (arumin[b][md] >= arumin[!b][i - 1] + cost(i, md)){
arumin[b][md] = arumin[!b][i - 1] + cost(i, md);
eren[level][md] = i;
}
DC(l, md - 1, s, eren[level][md]);
DC(md + 1, r, eren[level][md], e);
return;
}
int main(){
time_t START = clock();
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
memset(arumin, 63, sizeof arumin);
arumin[0][0] = 0;
int n, k; scanf("%d%d", &n, &k); k++;
for (int i = 1; i <= n; i++){
scanf("%lld", a + i);
a[i] += a[i - 1];
}
for (level = 1; level <= k; level++)
DC(level, n, level, n);
printf("%lld\n", (a[n] * a[n] - arumin[k % 2][n]) >> 1);
while (k > 1){
vec.push_back(eren[k][n] - 1);
n = eren[k][n] - 1;
k--;
}
reverse(vec.begin(), vec.end());
for (int x : vec)
printf("%d ", x);
printf("\n");
time_t FINISH = clock();
cerr << "Execution time: " << (ld)(FINISH - START) / CLOCKS_PER_SEC * 1000.0 << " milliseconds.\n";
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:59:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
int n, k; scanf("%d%d", &n, &k); k++;
~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:61:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", a + i);
~~~~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
6 ms |
2208 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
2048 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
2996 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
2688 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
7 ms |
2816 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
7 ms |
2944 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
6 ms |
2176 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
6 ms |
2176 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
12 ms |
3584 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
6 ms |
1916 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
3584 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
3328 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
14 ms |
3584 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
11 ms |
3584 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
7 ms |
2304 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
9 ms |
2688 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
2176 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
2176 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
75 ms |
10744 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
8 ms |
2176 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
62 ms |
7288 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
58 ms |
8184 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
74 ms |
8696 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
52 ms |
7416 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
58 ms |
8184 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
72 ms |
9848 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
4216 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
32 ms |
4480 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
728 ms |
81872 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
31 ms |
4728 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1006 ms |
81788 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
596 ms |
58292 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
755 ms |
62404 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
517 ms |
51192 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
554 ms |
58232 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
724 ms |
74172 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
