제출 #671591

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
671591		Baytoro	금 캐기 (IZhO14_divide)	C++17	100 / 100	35 ms	3476 KiB

divide

#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e9+9,mod=1e9+7;
int n,m;
void solve(){
	cin>>n;
	vector<int> x(n+1),g(n+1),d(n+1),pref(n+1);
	for(int i=1;i<=n;i++)
		cin>>x[i]>>g[i]>>d[i];
	for(int i=1;i<=n;i++){
		d[i]+=d[i-1];
		g[i]+=g[i-1];
		pref[i]=d[i-1]-x[i];
	}
	pref[0]=INF;
	for(int i=1;i<=n;i++)
		pref[i]=min(pref[i],pref[i-1]);
	for(int i=0;i<=n;i++)
		pref[i]=-pref[i];
	int res=0;
	for(int i=1;i<=n;i++){
		int X=d[i]-x[i];
		int r=i,l=lower_bound(all(pref),-X)-pref.begin();
		//cout<<l<<' '<<r<<endl;
		if(l==0) l=1;
		res=max(res,g[r]-g[l-1]);
	}
	cout<<res;
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

divide.cpp:42:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   42 | main(){
      | ^~~~
divide.cpp: In function 'void fopn(std::string)':
divide.cpp:12:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
divide.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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