Submission #86761

#	Time	Username	Problem	Language	Result	Execution time	Memory
86761		duy_tran	Divide and conquer (IZhO14_divide)	C++14	0 / 100	17 ms	3500 KiB

divide

#include<bits/stdc++.h>
using namespace std;

const int maxn=(int)1e5+50;
int n,x[maxn],bit[2*maxn];
long long gold[maxn],energy[maxn];
vector<long long> gt;

void Up(int id,int gt)
{
     if(id==0)return;

     for(;id<=2*n+2;id+=id&-id)bit[id]=min(bit[id],gt);
}

int Get(int id)
{
    if(id==0) return (int)1e6;

    int res=(int)1e6;

    for(;id>0;id-=id&-id)res=min(res,bit[id]);

    return res;
}

int main()
{
    cin>>n;

    memset(bit,(int)1e6,sizeof(bit));

    for(int i=1;i<=n;++i)
    {
        long long g,d;
        cin>>x[i]>>g>>d;

        gold[i]=gold[i-1]+g;
        energy[i]=energy[i-1]+d;

        gt.push_back(energy[i]-x[i]);
        gt.push_back(energy[i-1]-x[i]);
    }

    sort(gt.begin(),gt.end());

    gt.erase(unique(gt.begin(),gt.end()));

    long long Max=0;

    for(int i=1;i<=n;++i)
    {
        Max=max(Max,gold[i]-gold[i-1]);

        int pos=lower_bound(gt.begin(),gt.end(),energy[i]-x[i])-gt.begin()+1;

        int l=Get(pos);

        if(l!=(int)1e6)Max=max(Max,gold[i]-gold[l-1]);

        pos=lower_bound(gt.begin(),gt.end(),energy[i-1]-x[i])-gt.begin()+1;

        Up(pos,i);
    }

    cout<<Max;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 31
• Subtask 3: 0 / 52