#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=1e5;
int n, k, a[mxN], last[mxN][201];
ll p[mxN+1], dp[mxN], dp2[mxN];
// p[i+1]x + dp[i] - p[i+1]*p[n]
double ix(int i, int j) {
ll a=p[i+1], b=dp[i]-p[i+1]*p[n];
ll c=p[j+1], d=dp[j]-p[j+1]*p[n];
return (double)(b-d)/(c-a);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i=0; i<n; ++i) {
cin >> a[i];
p[i+1]=p[i]+a[i];
}
for (int i=0; i<n; ++i) {
dp[i]=p[i+1]*(p[n]-p[i+1]);
last[i][0]=-1;
}
for (int i=1; i<=k; ++i) {
deque<int> dq;
auto Add=[&](int j) {
if (dq.size()&&!a[j])
return;
while(dq.size()>=2&&ix(dq.end()[-2], j)<ix(dq.end()[-2], dq.back()))
dq.pop_back();
dq.push_back(j);
};
memcpy(dp2, dp, sizeof(dp));
//for (int j=0; j<i; ++j)
Add(i-1);
for (int j=i; j<n; ++j) {
while(dq.size()>=2&&ix(dq[0], dq[1])<p[j+1])
dq.pop_front();
dp2[j]=p[j+1]*(p[n]-p[j+1])+p[j+1]*p[dq[0]+1]+dp[dq[0]]-p[dq[0]+1]*p[n];
last[j][i]=dq[0];
//cout << i << " " << j << " " << dq[0] << "\n";
Add(j);
}
memcpy(dp, dp2, sizeof(dp));
}
cout << dp[n-1] << "\n";
vector<int> ans(k);
for (int i=k, c=n-1; i; --i) {
c=last[c][i];
ans[i-1]=c;
}
for (int i : ans)
cout << i+1 << " ";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
1868 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
3 ms |
1868 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
1868 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
1996 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
1996 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
16 ms |
2052 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1996 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
12 ms |
2056 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
15 ms |
2056 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
16 ms |
2056 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
2100 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
4 ms |
1996 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
6 ms |
1988 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2636 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
2636 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
27 ms |
2696 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2636 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
26 ms |
2636 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
22 ms |
2692 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
27 ms |
2636 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
26 ms |
2756 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
7 ms |
2700 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
12 ms |
2700 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
9800 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
8 ms |
9796 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
133 ms |
9804 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
9804 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
82 ms |
9900 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
91 ms |
9872 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
112 ms |
9876 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
86 ms |
9924 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
92 ms |
9804 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
118 ms |
9884 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
62 ms |
81860 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
60 ms |
81896 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1203 ms |
81912 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
64 ms |
81920 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1243 ms |
81856 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
844 ms |
81960 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1039 ms |
81912 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
796 ms |
81928 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
833 ms |
81988 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1067 ms |
81860 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
