#include <bits/stdc++.h>
using namespace std;
#define int long long
struct fraction {
int n,d;
fraction(int n,int d):n(n),d(d){}
bool operator<(const fraction &other) const {
return __int128(n)*__int128(other.d)<__int128(other.n)*__int128(d);
}
};
struct line {
int m,k,idx_1,idx_2;
line(int m,int k,int idx_1,int idx_2):m(m),k(k),idx_1(idx_1),idx_2(idx_2){}
int operator()(int x) const {
return m*x+k;
}
};
fraction getIntersect(line a,line b) {
return {a.k - b.k,b.m - a.m};
}
deque<line> hull;
void addline(line x) {
if(!hull.empty() and hull.back().m==x.m){
if(hull.back().k<=x.k){
hull.pop_back();
addline(x);
}
return;
}
while(hull.size()>1 and getIntersect(hull[hull.size()-2],x)<getIntersect(hull[hull.size()-2],hull.back()))hull.pop_back();
hull.emplace_back(x);
}
tuple<int,int,int> get(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];
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=1;i<=n;i++)DP[i][0]=INT32_MIN;
for(int j=1;j<=k;j++){
hull.clear();
addline({0,0,0,0});
for(int i=1;i<=n;i++){
if(j!=1)for(int x=i-1;x;x--){
if(DP[i][j]<P[i]*P[x]-P[x]*P[x]+DP[x][j-1]){
DP[i][j] = P[i]*P[x]-P[x]*P[x]+DP[x][j-1];
back[i][j] = {x,j-1};
}
}
auto [ans,last1,last2] = get(P[i]);
if(ans!=DP[i][j]){
cout << "FUCK\n";
for(int x=1;x<hull.size();x++) {
auto temp = getIntersect(hull[x - 1], hull[x]);
cout << (long double)(temp.n)/(long double)(temp.d) << ' ';
}
cout << '\n';
}
back[i][j] = {last1,last2};
addline({P[i],DP[i][j-1]-P[i]*P[i],i,j-1});
}
}
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';
}
Compilation message
sequence.cpp: In function 'int32_t main()':
sequence.cpp:69:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::deque<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
69 | for(int x=1;x<hull.size();x++) {
| ~^~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Incorrect |
1 ms |
4444 KB |
Expected integer, but "FUCK" found |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Incorrect |
1 ms |
4444 KB |
Expected integer, but "FUCK" found |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4696 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Incorrect |
10 ms |
4564 KB |
Expected integer, but "FUCK" found |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Incorrect |
222 ms |
11480 KB |
Expected integer, but "FUCK" found |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
301 ms |
51804 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
330 ms |
52312 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Execution timed out |
2059 ms |
83444 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
43 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |