# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093158 | vukhacminh | Split the sequence (APIO14_sequence) | C++17 | 918 ms | 86452 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.
#include<bits/stdc++.h>
#define all(x) (x).begin() , (x).end()
#define pll pair<long long, long long>
#define pii pair<int , int>
#define fi first
#define se second
#define bit(i,j) ((j >> i) & 1)
using namespace std;
#define int long long
const long long inf = 1e18+1;
const int mod = 998244353;
const int MAXN = 100000;
int x[MAXN+10] , pre[MAXN + 10];
int dp[MAXN+10] , lst[MAXN+ 10] ;int32_t trace[MAXN+10][210];
void compute(int l , int r , int optl , int optr , int k){
if(l > r) return;
int m = l + r >> 1;
pll res = {-1e18 , -1};
for(int i = optl ; i <= min(m , optr) ; i++){
int t = lst[i-1] + ((pre[m] - pre[i-1]) * pre[i-1]);
res= max(res , {t , i});
}
trace[m][k] = res.se-1;
dp[m] = res.fi;
int opt = res.se;
compute(l , m-1 , optl , opt , k);
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... |