#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
const int K = 201;
int n,k;
long long s[N];
int dp[N][K];
long long val[N][2];
vector<long long> m,b,id;
bool bad(int l1,int l2,int l3)
{
return (double)(b[l2]-b[l3])*(m[l2]-m[l1])<(double)(b[l1]-b[l2])*(m[l3]-m[l2]);
}
void add(long long mx,long long bx,long long idx)
{
if(!m.empty() and m.back()==mx and b.back()==bx) return;
m.push_back(mx),b.push_back(bx),id.push_back(idx);
while(m.size()>2 and bad(m.size()-3,m.size()-2,m.size()-1))
m.erase(m.end()-2),b.erase(b.end()-2),id.erase(id.end()-2);
}
int ptr;
void query(long long x,long long &a,int &bb)
{
if(m.empty()) return void(a = bb = 0);
if(ptr>=m.size()) ptr = m.size()-1;
while(ptr<m.size()-1 and m[ptr+1]*x+b[ptr+1]>=m[ptr]*x+b[ptr]) ptr++;
a = m[ptr]*x+b[ptr];
bb = id[ptr];
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
for(int i = 1;i <= n;i++) cin >> s[i],s[i]+=s[i-1];
int now = 1,prev = 0;
for(int j = 0;j <= k;j++)
{
m.clear(),b.clear(),id.clear();
ptr = 0;
for(int i = 1;i <= n;i++)
{
if(j) query(s[i],val[i][now],dp[i][j]);
if(i!=n and !((j-1)>1 and !dp[i][j-1]) and j-1<i) add(s[i],val[i][prev]-s[i]*s[i],i);
}
swap(now,prev);
}
cout << val[n][prev] << '\n';
vector<int> ans;
int l = k;
for(int x = dp[n][k];x;x = dp[x][--l]) ans.push_back(x);
reverse(ans.begin(),ans.end());
for(int x : ans) cout << x << ' ';
}
Compilation message
sequence.cpp: In function 'void query(long long int, long long int&, int&)':
sequence.cpp:31:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(ptr>=m.size()) ptr = m.size()-1;
~~~^~~~~~~~~~
sequence.cpp:32:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(ptr<m.size()-1 and m[ptr+1]*x+b[ptr+1]>=m[ptr]*x+b[ptr]) ptr++;
~~~^~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
512 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
532 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
512 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 |
512 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
1280 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
8704 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
8704 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
57 ms |
9088 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
8960 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
45 ms |
8704 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
50 ms |
8784 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
52 ms |
8960 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
40 ms |
8932 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
45 ms |
8860 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
56 ms |
8960 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
56 ms |
83676 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
54 ms |
83744 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
777 ms |
84440 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
56 ms |
84440 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
806 ms |
83672 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
639 ms |
83672 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
690 ms |
84440 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
531 ms |
84312 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
547 ms |
84056 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
696 ms |
84056 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
