#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define setbit(s, i) (s|=(1LL<<(i)))
#define bit(s, i) (((s)>>(i))&1LL)
#define mask(i) ((1LL<<(i)))
#define builtin_popcount __builtin_popcountll
typedef long long ll;
typedef long double ld;
template <typename T> inline void read(T &x){
char c;
bool nega=0;
while((!isdigit(c=getchar()))&&(c!='-'));
if(c=='-'){
nega=1;
c=getchar();
}
x=c-48;
while(isdigit(c=getchar())) x=x*10+c-48;
if(nega) x=-x;
}
template <typename T> inline void writep(T x){
if(x>9) writep(x/10);
putchar(x%10+48);
}
template <typename T> inline void write(T x){
if(x<0){
putchar('-');
x=-x;
}
writep(x);
}
template <typename T> inline void writeln(T x){
write(x);
putchar('\n');
}
#define taskname "sequence"
#define sqr(x) ((x)*(x))
int n, k;
int s[100001];
ll sqs[100001];
ll f[100001];
int trace[201][100001];
vector <int> q;
const ll inf=mask(60);
void track(int nn, int k){
if(nn==0) return;
track(trace[k][nn], k-1);
if(nn==n) return;
write(nn);
putchar(' ');
}
int first[100001];
ll b[100001];
ll first_better(int i, int j){
if(b[j]<=b[i]) return 0;
if(s[i]==s[j]) return inf;
return (b[j]-b[i]-1)/(s[i]-s[j])+1;
}
int main(){
#ifdef Kanikou
if(fopen(taskname".inp", "r"))
freopen(taskname".inp", "r", stdin);
#endif // Kanikou
ios_base::sync_with_stdio(false);
cin.tie(NULL);
read(n);
read(k);
FOR(i, 1, n) read(s[i]);
FOR(i, 1, n) s[i]+=s[i-1];
FOR(i, 1, n) sqs[i]=((ll)s[i])*s[i];
ll a;
FOR(j, 1, k){
int p=0;
q.clear();
q.pb(0);
FOR(i, 1, n){
b[i]=f[i]-sqs[i];
p=min(p, ((int)q.size())-1);
while((p+1<q.size())&&(first[q[p+1]]<=s[i])) p++;
f[i]=((ll)s[i])*s[q[p]]+b[q[p]];
trace[j][i]=q[p];
while(true){
a=first_better(i, q.back());
if(a>=s[n]) break;
if(a<=first[q.back()]){
q.pop_back();
if(q.empty()){
first[i]=0;
q.pb(i);
break;
}
}
else{
first[i]=a;
q.pb(i);
break;
}
}
}
}
writeln(f[n]);
track(n, k);
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:85:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while((p+1<q.size())&&(first[q[p+1]]<=s[i])) p++;
~~~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
492 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
572 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
572 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
868 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
868 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
868 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
868 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
868 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
868 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
868 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
868 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
868 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
868 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
4 ms |
1764 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1764 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1764 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1764 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1788 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
1788 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
1788 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
1788 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1788 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1788 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
2428 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2428 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
2428 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
2428 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
2428 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2428 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
2428 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
2428 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2428 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
2428 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
59 ms |
9852 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
9852 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
72 ms |
9852 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
72 ms |
9852 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
58 ms |
9852 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
42 ms |
9852 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
47 ms |
9852 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
61 ms |
9852 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
9852 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
16 ms |
9852 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
606 ms |
82548 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
17 ms |
82548 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
833 ms |
82644 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
539 ms |
82644 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
641 ms |
82644 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
417 ms |
82644 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
436 ms |
82644 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
587 ms |
82644 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
