题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=2653
关于这道题嘛,首先二分是很容易想的。我们二分中位数,然后判断是否能够达到。设中位数为Mid,如果我们把大于等于Mid的标记为1,小于Mid的标记为-1,则只要存在一段区间满足左端点在[a,b]且右端点在[c,d]并且和大于等于0的即是可行。我们发现[b,c]是必选的,因此我们只要求出[a,b-1]的最大后缀和和[c+1,d]的最大前缀和即可。我们不可能每次建棵树对吧,但注意到Mid只有在已经存在的数中取到才有意义,因此真正有用的线段树只有<=n棵,我们将权值离散化一下,再按权值从小到大建主席树,每次只涉及一种权值的数由1变为-1,这样每次二分就可以方便地查询了。。。主席树n*log(n),二分+查询q*log(n)*log(n)。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 20000+10;
struct Seg {
int sum,ML,MR,lc,rc;
}T[maxn*16];
struct Num {
int id,next;
}e[maxn];
int n,m,bcnt,cnt,k,ans,sum,tot,la,q[10],R[maxn],t[maxn],a[maxn],head[maxn],p[maxn],root[maxn];
int Build(int l,int r) {
int now = ++bcnt;
T[now].sum = T[now].ML = T[now].MR = r-l+1;
if(l == r)return now;
int mid = (l+r) >> 1;
T[now].lc = Build(l,mid);
T[now].rc = Build(mid+1,r);
return now;
}
void Update(int u) {
int lc = T[u].lc,rc = T[u].rc;
T[u].sum = T[lc].sum + T[rc].sum;
T[u].ML = max(T[lc].ML,T[lc].sum + T[rc].ML);
T[u].MR = max(T[rc].MR,T[rc].sum + T[lc].MR);
}
int Add(int u,int l,int r,int po) {
int now = ++bcnt;T[now] = T[u];
if(l == r) {T[now].sum = -1;T[now].ML = T[now].MR = 0;return now;}
int mid = (l+r) >> 1;
if(po <= mid)T[now].lc = Add(T[u].lc,l,mid,po);
else T[now].rc = Add(T[u].rc,mid+1,r,po);
Update(now);
return now;
}
int query_sum(int u,int l,int r,int L,int R) {
if(l >= L && r <= R)return T[u].sum;
int mid = (l+r) >> 1,ret = 0;
if(L <= mid)ret += query_sum(T[u].lc,l,mid,L,R);
if(R > mid)ret += query_sum(T[u].rc,mid+1,r,L,R);
return ret;
}
void pre(int u,int l,int r,int L,int R) {
if(l == L && r == R) {p[++tot] = u;return;}
int mid = (l+r) >> 1;
if(R <= mid)pre(T[u].lc,l,mid,L,R);
else if(L > mid)pre(T[u].rc,mid+1,r,L,R);
else {pre(T[u].lc,l,mid,L,mid);pre(T[u].rc,mid+1,r,mid+1,R);}
}
bool Check(int x,int a,int b,int c,int d) {
int ret = query_sum(root[x],1,n,b,c);
tot = 0;ans = 0;sum = 0;pre(root[x],1,n,a,b-1);
for(int i = tot; i ; i--) {
if(sum + T[p[i]].MR > ans)ans = sum + T[p[i]].MR;
sum += T[p[i]].sum;
}
ret += ans;
tot = 0;ans = 0;sum = 0;pre(root[x],1,n,c+1,d);
for(int i = 1; i <= tot; i++) {
if(sum + T[p[i]].ML > ans)ans = sum + T[p[i]].ML;
sum += T[p[i]].sum;
}
ret += ans;
return ret >= 0;
}
int getans(int a,int b,int c,int d) {
int l = 1,r = cnt;
while(l < r) {
int mid = (l+r+1) >> 1;
if(Check(mid,a,b,c,d))l = mid;
else r = mid-1;
}
return t[l];
}
int main() {
scanf("%d",&n);
memset(head,-1,sizeof(head));
for(int i = 1; i <= n; i++) {scanf("%d",&a[i]);R[i] = a[i];}
sort(R+1,R+n+1);
for(int i = 1; i <= n; i++)if(i == 1 || R[i] != R[i-1])t[++cnt] = R[i];
for(int i = 1; i <= n; i++)a[i] = lower_bound(t+1,t+cnt+1,a[i])-t;
root[1] = Build(1,n);
for(int i = 1; i <= n; i++) {
e[k].id = i;e[k].next = head[a[i]];head[a[i]] = k++;
}
int R = root[1];
for(int i = 2; i <= cnt; i++) {
for(int j = head[i-1]; j != -1; j = e[j].next) {
R = Add(R,1,n,e[j].id);
}
root[i] = R;
}
scanf("%d",&m);
for(int i = 1; i <= m; i++) {
scanf("%d%d%d%d",&q[0],&q[1],&q[2],&q[3]);
la %= n;q[0] %= n;q[1] %= n;q[2] %= n;q[3] %= n;
q[0] += la;q[1] += la;q[2] += la;q[3] += la;
q[0] %= n; q[1] %= n; q[2] %= n; q[3] %= n;
q[0]++; q[1]++; q[2]++; q[3]++;
sort(q,q+4);
printf("%d\n",la = getans(q[0],q[1],q[2],q[3]));
}
return 0;
}