제출 #1314349

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1314349		boclobanchat	금 캐기 (IZhO14_divide)	C++20	100 / 100	36 ms	5120 KiB

divide

#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+5;
const int INF=1e9;
long long val[MAXN],gold[MAXN],eneg[MAXN],V[MAXN*2];
int fen[MAXN*2];
void update(int i,int n,int val) { for(;i<=n;i+=i&-i) fen[i]=min(fen[i],val); }
int get(int i) { int ans=INF;for(;i;i-=i&-i) ans=min(ans,fen[i]);return ans; }
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>val[i]>>gold[i]>>eneg[i];
		eneg[i]+=eneg[i-1],gold[i]+=gold[i-1];
		V[i*2-1]=eneg[i]-val[i],V[i*2]=eneg[i-1]-val[i];
	}
	sort(V+1,V+n*2+1);
	long long ans=0;
	for(int i=0;i<=n*2;i++) fen[i]=INF;
	for(int i=1;i<=n;i++)
	{
		update(lower_bound(V+1,V+n*2+1,eneg[i-1]-val[i])-V,n*2,i-1);
		int pos=get(lower_bound(V+1,V+n*2+1,eneg[i]-val[i])-V);
		if(pos<=n) ans=max(ans,gold[i]-gold[pos]);
	}
	cout<<ans;
}

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