#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const ll is_query = -9223372036854775807;
struct line{
ll m,c,id = 0;//y = mx+c
line(ll a,ll b,ll d){m = a;c = b;id=d;}
ll eval(ll x){return m*x+c;}
ld interx(line l) {return (ld)((l.c - c)/(m - l.m));}
mutable function<const line*()> succ; //succesor
bool operator<(const line &r)const{
if(r.c != is_query)return r.m > m;
const line* s = succ();
if (!s) return 0;
ll x = r.m;
return 1.0L * c - s->c < 1.0L *(s->m - m) * x; //is x greater than the intersection point of s and succ?
//if yes then we move forward ez
}
};
vector<deque<line>>hulls(201);
void add(int i,line l){
if(hulls[i].empty()){hulls[i].pb(l);return;}
if(hulls[i].front().m == l.m){
if(l.c < hulls[i].front().c)hulls[i].front();
else return;
}
while(sz(hulls[i])>1){
line a = hulls[i][0];
line b = hulls[i][1];
if((l.c - a.c) *(b.m - a.m)>= (a.c - b.c)*(a.m - l.m))hulls[i].pop_front();
else break;
}
hulls[i].push_front(l);
}
PII query(int i,ll x){
while(sz(hulls[i]) > 1 && hulls[i].back().eval(x) < hulls[i][sz(hulls[i])-2].eval(x))hulls[i].pop_back();
return {hulls[i].back().eval(x),hulls[i].back().id};
}
int main()
{
owo
int n,k;
cin>>n>>k;
vector<ll>a(n);
for(int i=0;i<n;i++)cin>>a[i];
VII dp(n,vector<ll>(k+1)),par(n,vector<ll>(k+1));
add(0,line(0,0,-1));
vector<ll>p = a;
for(int i=1;i<n;i++)p[i]+=p[i-1];
for(int i=0;i<n-1;i++){
for(int j=k;j>=1;j--){
if(hulls[j-1].empty())continue;
PII v = query(j-1,p[n-1]-p[i]);
dp[i][j] = v.fi + p[i]*(p[n-1] - p[i]);
par[i][j] = v.se;
//cout<<i<<" "<<j<<" "<<v.se<<'\n';
add(j,line(-p[i],dp[i][j],i));
}
}
ll ans = 0;
for(int i=0;i<n-1;i++){ans = max(ans,dp[i][k]);}
//cout<<'\n';
cout<<ans<<'\n';
vector<int>seq;
for(int i=0;i<n;i++){
if(dp[i][k] == ans){
int cur = i;
for(int j=k;j>=1;j--){
seq.pb(cur);
if(cur == -1)break;
cur = par[cur][j];
}
break;
}
}
reverse(all(seq));
for(int x:seq)cout<<x+1<<" ";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
448 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
452 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
448 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 |
460 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
448 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
464 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 |
1100 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 |
972 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1100 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1100 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
588 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
588 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
592 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
716 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
13 ms |
3916 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
716 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
16 ms |
4044 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
3392 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
14 ms |
3916 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
13 ms |
4556 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
1356 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
1996 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2892 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
3148 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
155 ms |
36092 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
3020 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
94 ms |
23228 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
101 ms |
25284 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
128 ms |
28224 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
103 ms |
24172 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
114 ms |
26248 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
145 ms |
32580 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
50 ms |
24120 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
51 ms |
24768 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Runtime error |
83 ms |
131076 KB |
Execution killed with signal 9 |
| 4 |
Halted |
0 ms |
0 KB |
- |
