#include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int MAX=1e5+1000;
ll dp[210][MAX];
ll tab[MAX];
int pref[MAX];
ll prefix(int a,int b)
{
return pref[b]-pref[a-1];
}
class CHT
{
public:
deque<pair<ll,ll> > D;
void add(pair<ll,ll> f)
{
while(true)
{
if(D.size()<=1)
break;
pair<ll,ll> a=D.back();
D.pop_back();
pair<ll,ll> b=D.back();
// (a.nd-f.nd)/(f.st-a.st)<=(b.nd-a.nd)/(a.st-b.st);
// (a.nd-f.nd)*(a.st-b.st)<=(b.nd-a.nd)*(f.st-a.st)
ll x1=(a.nd-f.nd)*(a.st-b.st);
ll x2=(b.nd-a.nd)*(f.st-a.st);
if(x1<=x2)
continue;
else
{
D.pb(a);
break;
}
}
D.pb(f);
}
ll getmin(ll x)
{
while(D.size()>1)
{
pair<ll,ll> a=D.front();
D.pop_front();
pair<ll,ll> b=D.front();
ll p1=x*a.st+a.nd,p2=x*b.st+b.nd;
if(p2>=p1)
continue;
else
{
D.push_front(a);
break;
}
}
pair<ll,ll> a=D.front();
return x*a.st+a.nd;
}
};
vi ans;
int32_t main()
{
BOOST;
int n,k;
cin>>n>>k;
for (int i=1;i<=n;i++)cin>>tab[i];
for (int i=1;i<=n;i++)pref[i]=pref[i-1]+tab[i];
for (int i=1;i<=k;i++)
{
CHT L;
for (int j=2;j<=n;j++)
{
L.add(mp(pref[j-1],-(ll)pref[j-1]*pref[j-1]+dp[i-1][j-1]));
dp[i][j]=L.getmin(pref[j]);
}
}
/*
for (int i=1;i<=k;i++)
for (int j=1;j<=n;j++)
for (int l=j;l>=2;l--)
dp[i][j]=max(dp[i][j],prefix(l,j)*prefix(1,l-1)+dp[i-1][l-1]);
*/
cout<<dp[k][n]<<"\n";
int wsk=n;
for (int i=k;i>=1;i--)
for (int j=wsk;j>=2;j--)
if (dp[i][wsk]==prefix(j,wsk)*prefix(1,j-1)+dp[i-1][j-1])
{
wsk=j-1;
ans.pb(j-1);
break;
}
for (auto it:ans)cout<<it<<" ";
return 0;
}
Compilation message
sequence.cpp:16:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization ("O3")
sequence.cpp:17:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization ("unroll-loops")
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
1792 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
1280 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
1664 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
1792 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
768 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
10 ms |
3072 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
3072 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
2688 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
3200 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
3072 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
896 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
1420 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
888 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
60 ms |
17248 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
55 ms |
10608 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
54 ms |
12280 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
55 ms |
13048 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
42 ms |
10872 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
49 ms |
12288 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
60 ms |
15608 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
4280 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
22 ms |
4244 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Runtime error |
426 ms |
131072 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
