程序:
/**
* 度度熊就是要刷排名第一
*/
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <ctime>
using namespace std;
// 存放最大的两个
int first=1, second=0;
inline void compute(int &first, int &second, int &tmp)
{
if(tmp>first)
{
second = first;
first = tmp;
}
else if((tmp!=first) && (tmp>second))
{
second = tmp;
}
}
// 对于setInt1中元素的每个集合,添加一个新的元素,并计算集合异或值
void setConvert(map< set<int>, int > &setInt1, map< set<int>, int > &setInt2, vector<int> &intVec, int n)
{
setInt2.clear();
map< set<int>, int >::iterator iter;
for(iter=setInt1.begin(); iter!=setInt1.end(); ++iter)
{
for(int j=0; j<n; ++j)
{
set<int> setTmp = iter->first;
int tmp = intVec[j];
if(setTmp.find(tmp)!=setTmp.end() )
{
continue;
}
setTmp.insert(tmp);
tmp ^= iter->second;
if(setInt2.find(setTmp) == setInt2.end() )
{
setInt2.insert(make_pair(setTmp, tmp) );
compute(first, second, tmp);
}
}
}
}
int main()
{
vector< int > intVec;
int n;
cin>>n;
for(int i=0; i<n; ++i)
{
int tmp;
cin>>tmp;
intVec.push_back(tmp);
}
clock_t start = clock();
// 元素集,异或值
map< set<int>, int > setInt1;
map< set<int>, int > setInt2;
// 构造单元素的集合,并求最大者和此大者
for(vector<int>::iterator iter=intVec.begin(); iter!=intVec.end(); ++iter)
{
int tmp = *iter;
set<int> setTmp;
setTmp.insert(tmp);
setInt1.insert(make_pair(setTmp, tmp));
compute(first, second, tmp);
}
for(int i=1; i<n; ++i)
{
if(i%2==1)
{// 根据setInt1求setInt2
setConvert(setInt1, setInt2, intVec, n);
}
else
{// 根据setInt2求setInt1
setConvert(setInt2, setInt1, intVec, n);
}
}
cout<<first<<" "<<second<<endl;
cout<<"run time: "<< clock()-start<<" ms"<<endl;
return 0;
}
来源: https://i-blog.csdnimg.cn/blog_migrate/e69ceb080919b4af4030db1e08b91be7.jpeg