Submission #2391766

---

Source Code Expand

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<bitset>
#include<map>

#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

typedef long long LL;
typedef double db;

int get(){
	char ch;
	while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
	if (ch=='-'){
		int s=0;
		while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
		return -s;
	}
	int s=ch-'0';
	while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
	return s;
}

const int N = 100005;

int n;
LL C;
LL a[N];
int val[N];
LL pre[N];

int main(){
	n=get();
	scanf("%lld",&C);
	fo(i,1,n)scanf("%lld %d",&a[i],&val[i]);
	pre[0]=0;
	fo(i,1,n)pre[i]=pre[i-1]+val[i];
	LL ans=0;
	LL tmp;
	fo(i,1,n){
		tmp=pre[i]-a[i];
		if (tmp>ans)ans=tmp;
	}
	fo(i,1,n){
		tmp=pre[n]-pre[i-1]-(C-a[i]);
		if (tmp>ans)ans=tmp;
	}
	//pre[i]+pre[n]-pre[j-1]-(2*a[i]+C-a[j])
	LL pv=-1e16;
	fd(i,n,1){
		LL tmp=pre[i]-a[i]*2+pv;
		if (tmp>ans)ans=tmp;
		if (pre[n]-pre[i-1]-(C-a[i])>pv)pv=pre[n]-pre[i-1]-(C-a[i]);
	}
	pv=-1e16;
	fd(i,n,1){
		LL tmp=pre[i]-a[i]+pv;
		if (tmp>ans)ans=tmp;
		if (pre[n]-pre[i-1]-2ll*(C-a[i])>pv)pv=pre[n]-pre[i-1]-2ll*(C-a[i]);
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:41:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&C);
                  ^
./Main.cpp:42:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  fo(i,1,n)scanf("%lld %d",&a[i],&val[i]);
                                         ^

Judge Result