#include <bits/stdc++.h>
using namespace std;
#define int long long
struct line{
int m,n,idx_1,idx_2;
line(int m,int n,int idx_1,int idx_2):m(m),n(n),idx_1(idx_1),idx_2(idx_2){}
int operator()(int x) const{
return x*m + n;
}
};
long double intersection(line a,line b){
return (long double)(a.n-b.n)/(long double)(b.m-a.m);
}
void addline(deque<line> &hull, line x){
while(hull.size()>=2 and intersection(hull.back(),x)<=intersection(hull[hull.size()-2],hull.back()))hull.pop_back();
hull.emplace_back(x);
}
tuple<int,int,int> get(deque<line> &hull, int x){
while(hull.size()>=2 and hull.front()(x)<=hull[1](x))hull.pop_front();
return {hull.front()(x),hull.front().idx_1,hull.front().idx_2};
}
int DP[100001][202];
pair<int,int> back[100001][202];
deque<line> hulls[202];
int P[100001];
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n,k;
cin >> n >> k;k++;
for(int i=1;i<=n;i++)cin>>P[i];
for(int i=1;i<=n;i++)P[i]+=P[i-1];
for(int i=0;i<=k;i++)addline(hulls[i],{0,0,0,0});
for(int i=1;i<=n;i++){
for(int j=1;j<=k;j++){
auto [ans,last1,last2] = get(hulls[j-1],P[i]);
DP[i][j] = ans;
back[i][j] = {last1,last2};
addline(hulls[j],{P[i],DP[i][j]-P[i]*P[i],i,j});
}
}
cout << DP[n][k] << '\n';
vector<int> ans;
auto [curr1,curr2] = back[n][k];
while(curr1 and curr2){
ans.emplace_back(curr1);
auto [c1,c2] = back[curr1][curr2];curr1=c1;curr2=c2;
}
for(int&i:ans)cout<<i<<' ';
cout << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
2 ms |
4440 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Incorrect |
1 ms |
4444 KB |
Integer 2 violates the range [1, 1] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
4952 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
4704 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
4676 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Incorrect |
2 ms |
4700 KB |
Integer 200 violates the range [1, 199] |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
8796 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
8796 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
6 ms |
9052 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
8880 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
10 ms |
9304 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Incorrect |
6 ms |
9136 KB |
contestant didn't find the optimal answer: 4699030135 < 4699030287 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
25 ms |
52572 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
10 ms |
53084 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
69 ms |
53880 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
8 ms |
52568 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
48 ms |
54364 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Incorrect |
53 ms |
53628 KB |
contestant didn't find the optimal answer: 514786325281 < 514790755404 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
49 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |