# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23460 | rubabredwan | Split the sequence (APIO14_sequence) | C++14 | 0 ms | 1844 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/* Bismillahir Rahmanir Rahim */
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int K = 205;
vector<long long>M, B;
int ptr;
bool bad(int a, int b, int c){
return (B[a] - B[b]) * (M[c] - M[a]) > (B[a] - B[c]) * (M[b] - M[a]);
}
void add(long long m, long long b){
M.push_back(m);
B.push_back(b);
while(M.size() >= 3 && bad(M.size()-3, M.size()-2, M.size()-1)){
M.erase(M.end()-2);
B.erase(B.end()-2);
}
}
long long query(long long x){
if(ptr >= M.size()) ptr = M.size() - 1;
while(ptr + 1 < M.size() && M[ptr+1] * x + B[ptr+1] > M[ptr] * x + B[ptr]){
++ptr;
}
return M[ptr] * x + B[ptr];
}
long long dp[N][K], A[N], sum[N];
int n, k;
int main(){
scanf("%d %d", &n, &k);
for(int i=1;i<=n;i++){
scanf("%lld", &A[i]);
sum[i] = sum[i-1] + A[i];
}
for(int j=1;j<=k;j++){
M.clear();
B.clear();
ptr = 0;
//add(sum[1], -(sum[1] * sum[1]));
for(int i=2;i<=n;i++){
//dp[i][j] = query(sum[i]);
//add(sum[i], -(sum[i] * sum[i]) + dp[i][j-1]);
}
}
cout << dp[n][k] << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |