牛客国庆集训派对Day1 J.Princess Principal (括号匹配问题

题目链接

转自：https://blog.csdn.net/Mr_Treeeee/article/details/82933839

 

括号匹配果然是要用栈的啊，左括号进栈，右括号出栈。

很巧妙的用左括号为1，右括号为-1，如果前缀和为0就算合法。

但是还要满足一个条件，[l,r]中间的前缀和需要满足  最小值min-sum[l-1]>=0

保证中间不是 ))((  出现负数就行。所以需要求区间最小值。RMQ or 线段树

 

///                 .-~~~~~~~~~-._       _.-~~~~~~~~~-.
///             __.'              ~.   .~              `.__
///           .'//                  \./                  \\`.
///        .'//                     |                     \\`.
///       .'// .-~"""""""~~~~-._     |     _,-~~~~"""""""~-. \\`.
///     .'//.-"                 `-.  |  .-'                 "-.\\`.
///   .'//______.============-..   \ | /   ..-============.______\\`.
/// .'______________________________\|/______________________________`.
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/STACK:102400000,102400000")
//#pragma GCC target(sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx) 
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <fstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
#define fi first
#define se second
typedef long long LL;
typedef pair <int, int> ii;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e6+100;
const int maxx=1e7+10;
const double EPS=1e-8;
const double eps=1e-8;
const LL mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

struct X {
	int id,val;
}stk[maxn];

struct node {
	int l,r;
	LL mn;
}tree[maxn<<2];

int n,m,q;
int b[maxn];
int a[maxn];
int top=0;
LL sum[maxn];


void pushup(int index) {
	tree[index].mn=min(tree[index<<1].mn,tree[index<<1|1].mn);
}

void build(int l,int r,int index) {
	tree[index].l=l;
	tree[index].r=r;
	if(l==r) {
		tree[index].mn=sum[l];
		return ;
	}
	int mid=(l+r)>>1;
	build(l,mid,index<<1);
	build(mid+1,r,index<<1|1);
	pushup(index);
}
LL query(int l,int r,int index) {
	if(l<=tree[index].l&&r>=tree[index].r) 
		return tree[index].mn;
	else {
		LL Min=LINF;
		int mid=(tree[index].l+tree[index].r)>>1;
		if(l<=mid) 
			Min=min(Min,query(l,r,index<<1));
		if(r>mid)
			Min=min(Min,query(l,r,index<<1|1));
		return Min;
	}
}
void solve() {
	s_3(n,m,q);
	FOR(1,n,i) s_1(a[i]),b[i]=-INF;
	FOR(1,n,i) {
		if(a[i]%2==0) 
			stk[++top]={i,a[i]};
		else {
			if(stk[top].val+1==a[i]) {
				b[stk[top].id]=1;
				b[i]=-1;
				top--;
			}
			else top=0;
		}
	}
	FOR(1,n,i) sum[i]=sum[i-1]+b[i];
	build(1,n,1);
	W(q--) {
		int l,r;
		s_2(l,r);
		if(sum[r]-sum[l-1]==0&&query(l,r,1)-sum[l-1]>=0)
			puts("Yes");
		else puts("No");
	}
}
 
int main() {
	//freopen( "1.in" , "r" , stdin );
    //freopen( "1.out" , "w" , stdout );
    int t=1;
    //init();
    //s_1(t);
    for(int cas=1;cas<=t;cas++) {
        //printf("Case #%d: ",cas);
        solve();
    }
}