For an array bb of length mm we define the function ff as
where ⊕⊕ is bitwise exclusive OR.
For example, f(1,2,4,8)=f(1⊕2,2⊕4,4⊕8)=f(3,6,12)=f(3⊕6,6⊕12)=f(5,10)=f(5⊕10)=f(15)=15f(1,2,4,8)=f(1⊕2,2⊕4,4⊕8)=f(3,6,12)=f(3⊕6,6⊕12)=f(5,10)=f(5⊕10)=f(15)=15
You are given an array aa and a few queries. Each query is represented as two integers ll and rr. The answer is the maximum value of ff on all continuous subsegments of the array al,al+1,…,aral,al+1,…,ar.
The first line contains a single integer nn (1≤n≤50001≤n≤5000) — the length of aa.
The second line contains nn integers a1,a2,…,ana1,a2,…,an (0≤ai≤230−10≤ai≤230−1) — the elements of the array.
The third line contains a single integer qq (1≤q≤1000001≤q≤100000) — the number of queries.
Each of the next qq lines contains a query represented as two integers ll, rr (1≤l≤r≤n1≤l≤r≤n).
Print qq lines — the answers for the queries.
3 8 4 1 2 2 3 1 2
5 12
6 1 2 4 8 16 32 4 1 6 2 5 3 4 1 2
60 30 12 3
In first sample in both queries the maximum value of the function is reached on the subsegment that is equal to the whole segment.
In second sample, optimal segment for first query are [3,6][3,6], for second query — [2,5][2,5], for third — [3,4][3,4], for fourth — [1,2][1,2].
题目大概:
求一个连续区间的最大值。连续区间的最大值可以是该区间的任何一个子连续区间的值。一个区间的值,要符合上面的函数。
即 f(1,2,4,8)=f(1⊕2,2⊕4,4⊕8)=f(3,6,12)=f(3⊕6,6⊕12)=f(5,10)=f(5⊕10)=f(15)=15f(1,2,4,8)=f(1⊕2,2⊕4,4⊕8)=f(3,6,12)=f(3⊕6,6⊕12)=f(5,10)=f(5⊕10)=f(15)=15
思路:
看到这个函数就可以想到和区间dp很像。一个大区间可以是两个子区间的异或,也可以是子区间的任意一个。
dp【i】【j】表示i到j的连续区间的最大值。
每次都是从比它小1的区间递推过来的。
所以dp【i】【j】=max(dp【i】【j】,dp【i+1】【j】,dp【i】【j-1】);
不过需要预处理一下。
代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn=5500;
int a[maxn];
int dp[maxn][maxn];
int n;
void init()
{
for(int i=1;i<n;i++)
{
for(int l=1;l<=n-i;l++)
{
int r=l+i;
dp[l][r]=dp[l+1][r]^dp[l][r-1];
}
}
}
int main()
{
int q;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
dp[i][i]=a[i];
}
scanf("%d",&q);
init();
for(int i=1;i<n;i++)
{
for(int l=1;l<=n-i;l++)
{
int r=l+i;
dp[l][r]=max(dp[l][r],max(dp[l+1][r],dp[l][r-1]));
}
}
int u,v;
while(q--)
{
scanf("%d%d",&u,&v);
printf("%d\n",dp[u][v]);
}
return 0;
}