#include<bits/stdc++.h>
using namespace std;
vector<long long> v, sum;
vector<pair<pair<long long, long long>, long long> > cht;
long long dp[100010], ans, n, k, p;
int pa[100010][210];
bool chk(long long p1, long long p2, pair<long long, long long> c){
pair<long long, long long> a = cht[p1].first;
pair<long long, long long> b = cht[p2].first;
if(b.first == c.first && b.second == c.second) return false;
if(a.first == b.first && a.second == b.second && p1 > 0) return chk(p1-1, p1, c);
if(a.first == b.first && a.second == b.second && c.second > b.second) return true;
if(a.first == b.first && a.second == b.second) return false;
if((a.second-c.second)*(b.first-a.first) <= (a.second-b.second)*(c.first-a.first)) return true;
else return false;
}
bool chk2(pair<long long, long long> a, pair<long long, long long> b, long long c){
if(b.first*c + b.second >= a.first*c + a.second) return true;
else return false;
}
int main(){
scanf("%lld %lld", &n, &k);
sum.resize(n); v.resize(n);
for(long long i = 0;i < n;i++) scanf("%lld", &v[i]);
for(long long i = 0;i < n;i++) for(long long j = 0;j < k;j++) pa[i][j] = -1;
sum[0] = v[0];
for(long long i = 1;i < n;i++) sum[i] = sum[i-1] + v[i];
for(long long i = 1;i < n;i++){
dp[i] = sum[i-1]*(sum[n-1]-sum[i-1]);
}
for(long long j = 1;j < k;j++){
for(long long i = 1;i < n;i++){
while(cht.size() >= 2 && chk(cht.size()-2, cht.size()-1, {sum[i-1], dp[i]-sum[i-1]*sum[n-1]})) cht.pop_back();
cht.push_back({{sum[i-1], dp[i]-sum[i-1]*sum[n-1]}, i});
}
long long x = 0;
for(long long i = j + 1;i < n;i++){
while(x < cht.size()-1 && cht[x+1].second < i && chk2(cht[x].first, cht[x+1].first, sum[i-1])) x++;
dp[i] = cht[x].first.first*sum[i-1] + cht[x].first.second + sum[i-1]*(sum[n-1]-sum[i-1]);
pa[i][j] = cht[x].second;
}
cht.clear();
}
for(long long i = k;i < n;i++){
if(ans <= dp[i]){
ans = dp[i];
p = i;
}
}
printf("%lld\n", ans);
vector<long long> ret;
while(p != -1){
ret.push_back(p);
p = pa[p][k-- -1];
}
reverse(ret.begin(), ret.end());
for(long long i = 0;i < ret.size();i++) printf("%lld ", ret[i]);
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:43:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
43 | while(x < cht.size()-1 && cht[x+1].second < i && chk2(cht[x].first, cht[x+1].first, sum[i-1])) x++;
| ~~^~~~~~~~~~~~~~
sequence.cpp:62:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
62 | for(long long i = 0;i < ret.size();i++) printf("%lld ", ret[i]);
| ~~^~~~~~~~~~~~
sequence.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
25 | scanf("%lld %lld", &n, &k);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~
sequence.cpp:27:41: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
27 | for(long long i = 0;i < n;i++) scanf("%lld", &v[i]);
| ~~~~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
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 |
312 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 |
1 ms |
204 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 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 |
| # |
Verdict |
Execution time |
Memory |
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 |
| # |
Verdict |
Execution time |
Memory |
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 |
2 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 |
2 ms |
460 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
460 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 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 |
6 ms |
1204 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
1100 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
1100 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
1100 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
1100 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1100 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1100 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
9228 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
9168 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
56 ms |
9228 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
9 ms |
9228 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
49 ms |
9228 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
50 ms |
9260 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
50 ms |
9228 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
38 ms |
9276 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
41 ms |
9228 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
59 ms |
9232 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
54 ms |
88032 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
50 ms |
87992 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
642 ms |
88012 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
52 ms |
87992 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
763 ms |
87992 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
536 ms |
87964 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
528 ms |
87992 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
433 ms |
87996 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
506 ms |
88012 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
605 ms |
87992 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
