#include <bits/stdc++.h>
using namespace std;
int64_t sqr(int x){
return 1LL*x*x;
}
struct line{
int64_t m ,c; int idx;
int64_t eval(int64_t x) { return m*x + c; }
};
struct hull : deque <line> {
void add(int64_t m ,int64_t c ,int idx){
line l = {m ,c ,idx};
while(size() >= 2 && 1.0*(c - back().c)*(back().m - at(size()-2).m) >= 1.0*(back().m - m)*(at(size()-2).c - back().c))
pop_back();
push_back(l);
}
pair <int64_t ,int> eval(int64_t x){
while(size() >= 2 && at(0).eval(x) <= at(1).eval(x))
pop_front();
return {at(0).eval(x) , at(0).idx};
}
};
int main()
{
int n ,m;
scanf("%d%d",&n,&m);
vector <int> a(n) ,s{0};
for(int&i : a){
scanf("%d",&i);
s.push_back(s.back() + i);
}
vector <int64_t> dp(n+1) ,last_dp(n+1);
vector <vector <int>> trace(1 ,vector <int> (n+1 ,0));
for(int i = 0; i <= n; i++)
dp[i] = sqr(s[i]);
for(int k = 1; k <= m; k++){
last_dp = dp;
trace.push_back(vector <int> (n+1 ,0));
auto&from = trace.back();
hull h;
h.add(s[k] ,-sqr(s[k])-last_dp[k] ,k);
for(int i = k+1; i <= n; i++){
auto r = h.eval(2*s[i]);
dp[i] = sqr(s[i]) - r.first;
from[i] = r.second;
h.add(s[i] ,-sqr(s[i])-last_dp[i] ,i);
}
}
printf("%lld\n",(sqr(s.back()) - dp.back()) / 2);
for(int l = m ,i = n; l > 0; l--){
i = trace[l][i];
printf("%d ",i);
}
printf("\n");
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:54:16: warning: format '%lld' expects argument of type 'long long int', but argument 2 has type 'int64_t' {aka 'long int'} [-Wformat=]
54 | printf("%lld\n",(sqr(s.back()) - dp.back()) / 2);
| ~~~^ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| | |
| long long int int64_t {aka long int}
| %ld
sequence.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
29 | scanf("%d%d",&n,&m);
| ~~~~~^~~~~~~~~~~~~~
sequence.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
32 | scanf("%d",&i);
| ~~~~~^~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
252 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
204 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 |
204 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
332 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 |
332 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
1100 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
1100 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
972 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
1112 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
1100 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
460 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
588 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
716 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
716 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
91 ms |
8344 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
716 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
70 ms |
5264 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
74 ms |
6076 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
79 ms |
6596 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
59 ms |
5368 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
70 ms |
6076 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
87 ms |
7620 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
28 ms |
4612 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
30 ms |
4708 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
907 ms |
81532 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
29 ms |
4796 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1151 ms |
81376 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
804 ms |
57916 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
776 ms |
61948 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
640 ms |
50980 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
727 ms |
58304 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
931 ms |
73644 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
