2016多校训练Contest6: 1006 Stabilization hdu5798

Problem Description

The instability of a array A with length N is defined as  ∑N−1i=1(|A[i+1]−A[i]|) . In order to stabilize a array, changing every element A[i] to (A[i] xor X) is allowed. What is the smallest non-negative integer X to minimize the instability of a given array?

 

Input

There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. 
For each test case, the first line contains an integer N. Next line contains N integers, indicating the elements of the array. 
T<=10, 0<=A[i]<2^20, 1<=n<=10^5.

 

Output

For each test case, output two integers in one line, the smallest non-negative integer X and the minimum of the instability.

 

Sample Input

  
  

   
   2
3
0 3 0
3
1 3 1
  
  

 

Sample Output

  
  

   
   1 2
0 4
  
  
  
  


  
  

嗯。。看着别人的题解做的结果最后程序都差不多写的一模一样了。。总之先把链接发上来吧。。

http://www.cnblogs.com/sagitta/p/5741121.html

首先我们用f[i][j]来把n-1对abs关系压缩乘20*20的

f[i][j]表示最高不同的位为i，第j位取1的时候的贡献

如果第i位取1，则对答案的贡献取反

然后枚举x，就能做到2^20*400的复杂度了。但是这样单组大概要3~5S

考虑记忆化。

我们各种状态的统计有很多是重复的，所以我们可以存储下中间的值

nt[i]表示i的最高位1在第几位，这个可以通过预处理得到

总之代码和那个链接的基本相同...

#include<map>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int a[100001];
long long f[20][20];
long long fx[(1<<20)+5],ft[(1<<20)+5];
int nt[(1<<20)+5];//下一个为1的二进制位 
int tot;
int v[(1<<20)+5];
inline long long dfs(int d,int x,long long rev)
{
	if(v[x]==tot)
		return ft[x]*rev;
	v[x]=tot;
	ft[x]=0;
	if(x==0)
		return 0;
	int i=nt[x];
	ft[x]=f[d][i]+dfs(d,x^(1<<i),1);
	return ft[x]*rev;
}
int main()
{
	freopen("1006.in","r",stdin);
//	freopen("1006.ans","w",stdout);
	int i;
	for(i=2;i<1<<20;i++)
	{
		if((i&(-i))==i)
			nt[i]=nt[i-1]+1;
		else
			nt[i]=nt[i-1];
	}
	int T;
	scanf("%d",&T);
	while(T>0)
	{
		T--;
		int n;
		scanf("%d",&n);
		int i,j,k;
		for(i=1;i<=n;i++)
			scanf("%d",&a[i]);
		memset(f,0,sizeof(f));
		long long sum=0;
		for(i=2;i<=n;i++)
		{
			int x=a[i-1],y=a[i];
			if(x>y) {int t=x;x=y;y=t;}
			sum+=(long long)(y-x);
			int hi=19;
			while((x&(1<<hi))==(y&(1<<hi))&&hi>0)
				hi--;
			f[hi][hi]+=(long long)((x^(1<<hi))-(y^(1<<hi))-(y-x));
			for(j=hi-1;j>=0;j--)
				f[hi][j]+=(long long)((y^(1<<j))-(x^(1<<j))-(y-x));
		}
		int x;
		long long ans=sum,ansx=0;
		memset(v,0,sizeof(v));
		long long rev;
		for(x=0;x<1<<20;x++)
		{
			rev=(i&1);
			fx[x]=f[0][0]*rev;
		}
		tot=0;
		for(i=1;i<=19;i++)
		{
			tot++;
			for(x=0;x<1<<20;x++)
			{
				rev=(x&(1<<i));
				if(rev>1) rev=1;
				int trev;
				if(rev==1) trev=-1; else trev=1;
				fx[x]+=f[i][i]*rev+dfs(i,x&((1<<i)-1),trev);
			}
		}
		ansx=0;
		ans=sum+fx[0];
		for(x=1;x<1<<20;x++)
		{
			if(fx[x]+sum<ans)
			{

				ans=sum+fx[x];
				ansx=x;
			}
		}
		printf("%I64d %I64d\n",ansx,ans);
	}
	return 0;
}