#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 30, MOD = 1e9 + 7;
int n,k;
ll a[N];
ll pref[N],sf[N];
int p[N][203];
ll dp[N],tdp[N];
struct line{
ll k,b;
int pos = 0;
ll get(ll x){
return k * x + b;
}
};
long double cross(line a,line b){
return ((a.b - b.b) * 1.0 / ((b.k - a.k) * 1.0));
}
void add(vector<line> &st,line l){
while((int)st.size() > 1 && cross(l,st[(int)st.size() - 2]) <= cross(l,st.back())){
st.pop_back();
}
st.push_back(l);
}
pair<ll,ll> get(vector<line> &st,ll x){
int l = -1,r = (int)st.size() - 1;
while(r - l > 1){
int mid = (l + r) >> 1;
if(mid == (int)st.size() - 1 || (st[mid].b - st[mid + 1].b) * 1.0 >= x * 1.0 * (st[mid + 1].k - st[mid].k)){
r = mid;
}else{
l = mid;
}
}
return {st[r].get(x),st[r].pos};
}
void test(){
cin >> n >> k;
for(int i = 1;i <= n;i++){
cin >> a[i];
}
for(int i = 1;i <= n;i++){
pref[i] = pref[i - 1] + a[i];
}
for(int i = n;i >= 1;i--){
sf[i] = sf[i + 1] + a[i];
}
for(int i = 1;i <= k;i++){
vector<line> st;
add(st,{0,0});
for(int j = 1;j <= n;j++){
pair<ll,ll> G = get(st,sf[j + 1]);
dp[j] = G.first+ pref[j] * sf[j + 1];
p[j][i] = G.second;
if(!p[j][i]){
p[j][i] = j - 1;
}
line nv = {-pref[j],tdp[j],j};
add(st,nv);
}
for(int j = 1;j <= n;j++){
tdp[j] = dp[j];
dp[j] =0 ;
}
}
ll res = 0;
int ps = 0;
for(int i = 1;i < n;i++){
if(tdp[i] >= res){
res = tdp[i];
ps = i;
}
}
vector<int> f;
cout << res << '\n';
int k1 = k;
while(k){
f.push_back(ps);
ps = p[ps][k--];
}
reverse(f.begin(),f.end());
assert((int)f.size() == k1);
for(int j:f){
cout << j << ' ';
}
}
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);
int t = 1;
// cin >> t;
while(t--){
test();
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2392 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
604 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
604 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
604 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
2540 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
2 ms |
604 KB |
Integer 0 violates the range [1, 199] |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
2648 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
15 ms |
2652 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
16 ms |
2652 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
2652 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
16 ms |
1372 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
14 ms |
1112 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
5 ms |
2652 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
1368 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
9056 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
9036 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
230 ms |
9716 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
10604 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
140 ms |
9208 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
163 ms |
9252 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
191 ms |
9428 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
157 ms |
9432 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
168 ms |
9532 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
210 ms |
9428 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
84 ms |
88684 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
63 ms |
88604 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Execution timed out |
2071 ms |
89644 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
