牛客寒假算法基础集训营1 小a与星际探索

题目链接     https://ac.nowcoder.com/acm/contest/317/C

 

看了题解和别人的代码才会；

 

和背包dp差不多，dp数组要开大点，不然异或过程会越界

 

 

#include<bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int mapp[3005], b[3005], dp[12005];
int maxn = 5000;
bool cmp(int a, int b)
{
	return a > b;
}
int main()
{
	std::ios::sync_with_stdio(false);
	int n, cnta, cntb, i, j, temp;
	while(cin >> n)
	{
		memset(dp, 0, sizeof(dp));
		for(i = 0; i < n; i++)
		{
			cin >> mapp[i];
			b[i] = mapp[i];
		}
		if(mapp[0]<=mapp[n-1])
		{
			cout << "-1" << endl;
			continue;
		}
		sort(b, b+n,cmp);
		cnta = lower_bound(b, b+n, mapp[0],greater<int>()) - b;
		cntb = lower_bound(b, b+n, mapp[n-1],greater<int>()) - b; 
		dp[b[cnta]^b[cntb]] = 1;
		for(i = cnta+1; i < cntb; i++)
		{
			for(j = 0; j <= maxn; j++)
			{
				dp[j] |= dp[j^b[i]];
//				cout << dp[j] << "   " << j << "   " << b[i] << "  " << (j^b[i]) << "   " << dp[j^b[i]] << "   q qq  " << endl;
			}
		}
		int ans;
		for(j = maxn; j >= 0; j--)
		{
			if(dp[j])
			{
				ans =  j;
				break;
			}
				
		}
		cout << ans << endl;
	}
	

	return 0;
}