제출 #5396

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
5396		gs12117	금 캐기 (IZhO14_divide)	C++98	100 / 100	68 ms	6952 KiB

divide

#include<stdio.h>
#include<algorithm>
int n;
int x[100100];
int gold[100100];
long long int gsum[100100];
int eng[100100];
long long int esum[100100];
struct data{
	long long int gtot;
	long long int etot;
	bool operator<(const data &r)const{
		return etot<r.etot||(etot==r.etot&&gtot<r.gtot);
	}
};
data points[200100];
long long int ans;
int main(){
	int i;
	long long int ming;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d%d%d",&x[i],&gold[i],&eng[i]);
		gsum[i+1]=gold[i]+gsum[i];
		esum[i+1]=eng[i]+esum[i];
	}
	for(i=0;i<n;i++){
		points[i*2].gtot=gsum[i];
		points[i*2].etot=esum[i]-x[i];
		points[i*2+1].gtot=gsum[i+1];
		points[i*2+1].etot=esum[i+1]-x[i];
	}
	std::sort(points,points+2*n);
	ming=points[0].gtot;
	for(i=1;i<2*n;i++){
		if(ming>points[i].gtot)ming=points[i].gtot;
		if(ans<points[i].gtot-ming)ans=points[i].gtot-ming;
	}
	printf("%lld",ans);
}

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