#include<bits/stdc++.h>
using namespace std;
const int nax = 1e5 + 2;
const long long INF = 1e18;
int n, k;
long long a[nax], p[nax];
int par[nax][203];
struct line{
long long m, c, id;
line() {}
line(long long _m, long long _c, long long _id) {
m = _m, c = _c, id = _id;
}
long long eval(long long x) {
return m * x + c;
}
};
long long isecx(line a, line b) {
return (long double) (b.c - a.c) / (long double) (a.m - b.m);
}
struct CHT{
int sz = 0;
deque<line>dq;
void insert(line newLine) {
while(sz>=2 && isecx(dq[0], dq[1])<=isecx(newLine, dq[0])) {
dq.pop_front();
--sz;
}
dq.push_front(newLine);
++sz;
}
pair<long long, long long> query(long long x) {
while(sz>=2 && dq[sz-1].eval(x)<=dq[sz-2].eval(x)) {
dq.pop_back();
--sz;
}
return make_pair(dq[sz-1].eval(x), dq[sz-1].id);
}
};
void PlayGround() {
cin>>n>>k;
for(int i=1; i<=n; ++i) {
cin>>a[i];
}
for(int i=1; i<=n; ++i) {
p[i] = p[i-1] + a[i];
}
vector<long long>dp(nax);
for(int j=1; j<=k+1; ++j) {
vector<long long>new_dp(nax);
CHT myCHT;
myCHT.insert(line(-p[j-1], dp[j-1], j-1));
for(int i=j; i<=n; ++i) {
long long x = p[n] - p[i];
auto [y, id] = myCHT.query(x);
long long cons = p[i] * (p[n] - p[i]);
new_dp[i] = cons + y;
myCHT.insert(line(-p[i], dp[i], i));
par[i][j] = id;
}
dp.swap(new_dp);
}
cout<<dp[n]<<'\n';
vector<int>config;
int cur = n, j = k+1;
int cnt = k;
while(1) {
cur = par[cur][j];
--j;
cout<<cur<<' ';
--cnt;
if(cnt==0) break;
}
// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
PlayGround();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
1864 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
2 ms |
1904 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
3 ms |
1948 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
2 ms |
2004 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
6 ms |
2004 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
4 ms |
2004 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
5 ms |
2084 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
6 ms |
2004 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
3 ms |
2004 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
2 ms |
2004 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
3 ms |
2004 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
2 ms |
2740 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
11 ms |
2740 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
2 ms |
2740 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
13 ms |
2744 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
12 ms |
2740 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
15 ms |
2748 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
12 ms |
2748 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
4 ms |
2740 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
8 ms |
2864 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
10052 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
10 ms |
10180 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
84 ms |
10108 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
8 ms |
10052 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
75 ms |
10180 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
72 ms |
10092 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
81 ms |
10132 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
63 ms |
10108 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
69 ms |
10052 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
78 ms |
10104 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
51 ms |
83776 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
62 ms |
83920 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
948 ms |
84132 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
53 ms |
84080 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1121 ms |
84120 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
727 ms |
83884 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
740 ms |
84036 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
590 ms |
84040 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
633 ms |
83904 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
823 ms |
84016 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |