# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993558 | imarn | Triple Jump (JOI19_jumps) | C++14 | 730 ms | 77492 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 ll long long
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int mxn=5e5+5;
int a[mxn];
struct node{
int mx,mxf,mxa;
node operator+(node b){
node rs;
rs.mx=max({mx,b.mx,mxf+b.mxa});
rs.mxf=max(mxf,b.mxf);
rs.mxa=max(mxa,b.mxa);
return rs;
}
}t[4*mxn];
void build(int i,int l,int r){
if(l==r)return void(t[i]={0,0,a[l]});
int m=(l+r)>>1;build(2*i,l,m);build(2*i+1,m+1,r);
t[i]=t[2*i]+t[2*i+1];
}
void update(int i,int l,int r,int idx,int v){
if(r<idx||l>idx)return;
if(l==r){
t[i].mxf=max(t[i].mxf,v);
t[i].mx=t[i].mxf+t[i].mxa;
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... |