Submission #88687

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cmath>
#include <stack>

#define f first
#define s second
#define mkp make_pair
#define pb push_back
#define pii pair < int , int > 
#define FILL(a,b) memset(a,b,sizeof(a))
#define FOR(a,b,c) for(a=b;a<=c;a++)
#define TFOR(a,b,c) for(a=b;a>=c;a--)
#define VFOR(a,b) for(a=0;a<b.size();a++)
#define ll long long
#define INF (int)1000000000
#define LINF (ll)1e16
#define vi vector<int>

using namespace std;

int N,ss=0;
int Ar[1100005];
int sma[1100005];
int big[1100005];
pii ST[1100005];
pii val[110005];
vector< pii > vec,v2;

int main()
{
	int i,j;
	scanf(" %d",&N);
	FOR(i,1,N)
		scanf(" %d",&Ar[i]);

	ST[++ss]=mkp(-1,N+1);
	TFOR(i,N,1)
	{
		while(ST[ss].f > Ar[i]) ss--;
		sma[i]=ST[ss].s;
		ST[++ss]=mkp(Ar[i],i);
	}

	ss=0;
	ST[++ss]=mkp(INF,0);
	FOR(i,1,N)
	{
		while(ST[ss].f < Ar[i]) ss--;
		big[i]=ST[ss].s;
		ST[++ss]=mkp(Ar[i],i);
	}

	FOR(i,1,N)
		val[i]=mkp(Ar[i]-i,i);
	sort(val+1,val+N+1);

	FOR(i,1,N)
		FOR(j,i+1,N)
		{
			if(val[j].f!=val[i].f) break;
			if(val[j].s >= sma[val[i].s]) break;
			if(val[i].s <= big[val[j].s]) continue;
			vec.pb(mkp(val[i].s,val[j].s)); break;
		}

	sort(vec.begin(),vec.end());
	
	int mn=INF;
	for(i=vec.size()-1; i>=0; i--)
	{
		if(vec[i].s > mn) continue;
		v2.pb(vec[i]);
		mn=vec[i].s;
	}

	sort(v2.begin(),v2.end());
	printf("%d\n",(int)v2.size());
	VFOR(i,v2) printf("%d %d\n",v2[i].f,v2[i].s);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:36:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:38:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result