CodeForces 280B（单调栈）

CodeForces 280B Maximum Xor Secondary（单调栈）

Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, …, xk (k > 1) is such maximum element xj, that the following inequality holds: .

The lucky number of the sequence of distinct positive integers x1, x2, …, xk (k > 1) is the number that is equal to the bitwise excluding OR of the maximum element of the sequence and the second maximum element of the sequence.

You’ve got a sequence of distinct positive integers s1, s2, …, sn (n > 1). Let’s denote sequence sl, sl + 1, …, sr as s[l…r] (1 ≤ l < r ≤ n). Your task is to find the maximum number among all lucky numbers of sequences s[l…r].

Note that as all numbers in sequence s are distinct, all the given definitions make sence.

Input
The first line contains integer n (1 < n ≤ 105). The second line contains n distinct integers s1, s2, …, sn (1 ≤ si ≤ 109).

Output
Print a single integer — the maximum lucky number among all lucky numbers of sequences s[l…r].

Examples
Input
5
5 2 1 4 3
Output
7
Input
5
9 8 3 5 7
Output
15
Note
For the first sample you can choose s[4…5] = {4, 3} and its lucky number is (4 xor 3) = 7. You can also choose s[1…2].

For the second sample you must choose s[2…5] = {8, 3, 5, 7}.

• 题目大意：
  给你一串数，定义了一个幸运数：在一个连续区间里的最大值和次大值得异或值。让你求这串数得最大得幸运数。
• 解题思路：
  从左到右维护一个单调递减栈，从右往左维护一个单调递减栈。然后求出，每个点左边比他大的第一个数的位置 r[i] 和右边第一个比它大的位置 l[i],这样每个点作为次大值点就确定了两个区间，左边一个右边一个，然后我们遍历一遍，找到最大的异或值点就行。
• 实现细节：
  这个题不是很难 ，我觉得需要处理的细节的地方就两个
  1:左右端点要特判一下

		if(l[i]!=n+1)
			maxx=max(maxx,a[i]^a[l[i]]);
		if(r[i]!=0)
			maxx=max(maxx,a[i]^a[r[i]]);

2.我们只需要判断 a[i]^a[l[i]] 和 a[i] ^ a[r[i]]就行，不需要判断 a[l[i]] ^ a[r[i]].

• AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <cmath>
#define ll long long 
using namespace std;
const int maxn=1e5+19;
int n;
int a[maxn];
int l[maxn];///右边第一个比它大的数的位置
int r[maxn];///左边第一个比它大的数的位置
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	stack<int> s;
	stack<int> s2;
	for(int i=n;i>=1;i--)
	{
		while(s.size()&&a[s.top()]<a[i])
			s.pop();
		if(s.empty())
			l[i]=n+1;
		else
			l[i]=s.top();
		s.push(i);
	}

	for(int i=1;i<=n;i++)
	{
		while(s2.size()&&a[s2.top()]<a[i])
			s2.pop();
		if(s2.empty())
			r[i]=0;
		else
			r[i]=s2.top();
		s2.push(i);
	}
	int maxx=-1;
	for(int i=1;i<=n;i++)
	{
		if(l[i]!=n+1)
			maxx=max(maxx,a[i]^a[l[i]]);
		if(r[i]!=0)
			maxx=max(maxx,a[i]^a[r[i]]);
	}
	cout<<maxx<<endl;
}