Submission #88885

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<fstream>
#include<cstring>
#include<stack>
#include<vector>
using namespace std;
#define f first
#define s second
#define mp make_pair
#define T 1100000
int di[1100005],nkeb[1100005],nkek[1100005];
int n;
vector < int > v[2200005];
vector < pair < int , int > > qq,ww;
void oku(){
	int i;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		scanf("%d",&di[i]);
}
stack < pair < int , int > > st;
void coz(){
	int i,j,k;
	for(i=1;i<=n;i++){
		while(!st.empty() && st.top().f>di[i]){
			nkek[st.top().s]=i-1;
			st.pop();
		}
		st.push(mp(di[i],i));
	}
	while(!st.empty()){
		nkek[st.top().s]=n;
		st.pop();
	}
	for(i=n;i>=1;i--){
		while(!st.empty() && st.top().f<di[i]){
			nkeb[st.top().s]=i+1;
			st.pop();
		}
		st.push(mp(di[i],i));
	}
	while(!st.empty()){
		nkeb[st.top().s]=1;
		st.pop();
	}
	for(i=1;i<=n;i++)
		v[di[i]-i+T].push_back(i);
	int a,b;
	for(k=0;k<=2200000;k++)
		for(i=0;i<v[k].size();i++)
			for(j=i+1;j<v[k].size();j++){
				a=v[k][i];
				b=v[k][j];
				if(nkeb[b]<=a && nkek[a]>=b)
					qq.push_back(mp(a,b));
			}
	sort(qq.begin(),qq.end());
	int mn=1000000000;
	for(i=qq.size()-1;i>=0;i--){
		if(mn>qq[i].s)
			ww.push_back(qq[i]);
		mn=min(mn,qq[i].s);
	}
	sort(ww.begin(),ww.end());
	cout<<ww.size()<<endl;
	for(i=0;i<ww.size();i++)
		cout<<ww[i].f<<" "<<ww[i].s<<endl;
}
int main(){
	oku();
	coz();
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void oku()’:
./Main.cpp:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result
./Main.cpp:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result

Judge Result