Time Limit: 1 Sec

Memory Limit: 256 MB

题目连接

http://acm.uestc.edu.cn/#/problem/show/1157

Description

Input

Sample Output

2
4

对于40%的数据，n、m<=5000

对于100%的数据，n、m<=50000，|Ai|、x<=100000

//qscqesze
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <bitset>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
#include <stack>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 200006
#define mod 1000000007
#define eps 1e-9
#define e exp(1.0)
#define PI acos(-1)
#define lowbit(x) (x)&(-x)
const double EP  = 1E-10 ;
int Num;
//const int inf=0x7fffffff;
const ll inf=999999999;
inline ll read()
{ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;
}
//*************************************************************************************int n;
int a[maxn];struct data{int l,r,mn;
}tr[maxn*4];
void build(int k,int s,int t)
{tr[k].l=s;tr[k].r=t;if(s==t){tr[k].mn=a[s];return;}int mid=(s+t)>>1;build(k<<1,s,mid);build(k<<1|1,mid+1,t);tr[k].mn=max(tr[k<<1].mn,tr[k<<1|1].mn);
}
int ask(int k,int s,int t)
{int l=tr[k].l,r=tr[k].r;if(s==l&&t==r)return tr[k].mn;int mid=(l+r)>>1;if(t<=mid)return ask(k<<1,s,t);if(s>mid)return ask(k<<1|1,s,t);return max(ask(k<<1,s,mid),ask(k<<1|1,mid+1,t));
}
void update(int k,int x,int y)
{int l=tr[k].l,r=tr[k].r;if(l==r){tr[k].mn=y;return;}int mid=(l+r)>>1;if(x<=mid)update(k<<1,x,y);if(x>mid)update(k<<1|1,x,y);tr[k].mn=max(tr[k<<1].mn,tr[k<<1|1].mn);
}int l[300],r[300];
int belong[50001];
int block;
vector<int> Q[500];
int ans[maxn];
int num;
int main()
{n = read();int q=read();for(int i=1;i<=n;i++)a[i]=read();block = sqrt(n);int num = n/block;if(n%block)num++;for(int i=1;i<=num;i++)l[i]=(i-1)*block+1,r[i]=i*block;r[num]=n;for(int i=1;i<=n;i++)belong[i]=(i-1)/block+1;for(int i=1;i<=num;i++){int tmp = 0;for(int j=l[i];j<=r[i];j++){if(a[j]>=tmp){Q[i].push_back(a[j]);tmp = a[j];}}}build(1,1,n);char c[5];while(q--){scanf("%s",c);if(c[0]=='Q'){int x=read();int L = x+1 , R = n;while(L<=R){int mid = (L+R)>>1;if(ask(1,x+1,mid)<=a[x])L = mid+1;elseR = mid-1;}//cout<<l<<endl;ans[x] = L - x - 1;int x2=ans[x]+1+x;int k = belong[x2];int tmp = a[x2];int Ans = 0;if(x2!=n+1){for(int i=x2;i<=r[k];i++){if(a[i]>=tmp){Ans++;tmp = a[i];}}for(int i=k+1;i<=num;i++){if(!Q[i].empty()){if(tmp>Q[i][Q[i].size()-1])continue;Ans+=Q[i].end()-lower_bound(Q[i].begin(),Q[i].end(),tmp);tmp = Q[i][Q[i].size()-1];}}}printf("%d\n",Ans + ans[x]);}else{int x=read();int y=read();a[x]=y;update(1,x,y);int k = belong[x];Q[belong[x]].clear();int tmp = 0;for(int i=l[k];i<=r[k];i++){if(a[i]>=tmp){Q[k].push_back(a[i]);tmp = a[i];}}}}
}