# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
857925 | nammm | Split the sequence (APIO14_sequence) | C++14 | 1014 ms | 82700 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 pb push_back
#define ll long long
#define f first
#define s second
#define pll pair<ll,ll>
#define vi vector<int>
using namespace std;
const int N=1e5+5;
int par[1201][N]{0};
ll d1[N]{0},d2[N]{0};
ll a[N]{0};
int n;
int cur=1;
void solve(int l,int r,int opl,int opr){
int m=(l+r)>>1;
pll t = {0,0};
for(int i=opl;i<=min(opr,m);i++){
t=max(t,{d1[i]+(a[m]-a[i])*(a[n]-a[m]),i});
}
par[cur][m]=t.s;
d2[m]=t.f;
if(l>=r)return;
solve(l,m-1,opl,t.s),solve(m+1,r,t.s,opr);
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
int k;cin>>n>>k;
for(int i=1;i<=n;i++)cin>>a[i],a[i]+=a[i-1];
# | 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... |