#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[100001][202]={0};
ll pref[100001]={0};
ll p[100001][202];
struct line{
ll m,c;
line(ll _m, ll _c){m=_m;c=_c;}
ll intersect(line l){
return m-l.m==0 ? LLONG_MAX/4 : (l.c-c)/(m-l.m);
}
ll value(ll x){
return m*x+c;
}
};
deque<pair<line,ll>> q;
deque<ll> pos;
void insert(ll m, ll c){
line l(m,c);
while(!q.empty()&&q.front().second>=l.intersect(q.front().first)){
// cout << "irem" << ' ' << q.front().first.m << ' ' << q.front().first.c << ' ' << q.front().second << '\n';
q.pop_front();
pos.pop_front();
}
if(q.empty()){
q.push_front({l,0});
}else{
q.push_front({l,l.intersect(q.front().first)});
}
// cout << "iadd" << ' ' << q.front().first.m << ' ' << q.front().first.c << ' ' << q.front().second << '\n';
}
ll query(ll x){
while(q.size()>1&&q[q.size()-2].second<=x){
// cout << "qrem" << ' ' << q.back().first.m << ' ' << q.back().first.c << ' ' << q.back().second << '\n';
q.pop_back();
pos.pop_back();
}
// cout << "query" << ' ' << q.back().first.m << ' ' << q.back().first.c << ' ' << q.back().second << ' ' << q.back().first.value(x) <<'\n';
return q.back().first.value(x);
}
int main(){
// cin.tie(0)->sync_with_stdio(0);
int n, k; cin >> n >> k;
vector<ll> a(n);
for(int i=0;i<n;i++)cin >> a[i];
for(int i=0;i<n;i++)pref[i+1]=pref[i]+a[i];
for(int j=1;j<=k+1;j++){
q.clear();
pos.clear();
for(int i=1;i<=n;i++){
insert(pref[i-1],dp[i-1][j-1]-pref[i-1]*pref[n]);
pos.push_front(i-1);
dp[i][j]=query(pref[i])-pref[i]*pref[i]+pref[i]*pref[n];
p[i][j]=pos.back();
// for(int x=0;x<i;x++){
// if(dp[x][j-1]+(pref[i]-pref[x])*(pref[n]-pref[i])>=dp[i][j]){
// dp[i][j]=dp[x][j-1]+(pref[i]-pref[x])*(pref[n]-pref[i]);
// p[i][j]=x;
// }
// cout << '(' << i << ' ' << j << ')' << dp[i][j] << ' ' << p[i][j] << ' ';
}
// cout << '\n';
}
cout << dp[n][++k] << '\n';
int sus=p[n][k--];
while(k>0){
cout << sus << ' ';
sus=p[sus][k--];
}
return 0;
// 7 3
// 4 1 3 4 0 2 3
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Incorrect |
0 ms |
348 KB |
Integer 0 violates the range [1, 1] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
0 ms |
604 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Incorrect |
1 ms |
604 KB |
contestant didn't find the optimal answer: 933701 < 933702 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
856 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
960 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
1116 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
860 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Incorrect |
1 ms |
1116 KB |
contestant didn't find the optimal answer: 1019625816 < 1019625819 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
3420 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
2 ms |
3420 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
7 ms |
3672 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
2 ms |
3420 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Incorrect |
7 ms |
3672 KB |
contestant didn't find the optimal answer: 679388318 < 679388326 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
32348 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
15 ms |
32344 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Incorrect |
74 ms |
32412 KB |
contestant didn't find the optimal answer: 4973126687469560 < 4973126687469639 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
62 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |