【贪心】Codeforces Round #177 (Div. 1) C - Polo the Penguin and XOR operation

贪心，从最大的数字开始，每次找互补尽量大的数字。。。

#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 1000005
#define maxm 1000005
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
//head

int ans[maxn];
bool vis[maxn];
int a[105];
int xp[105];
int n;

void read()
{
	scanf("%d", &n);
}

void work()
{
	int mx = 0;
	xp[0] = 1;
	for(int i = 1; i <= 30; i++) xp[i] = xp[i - 1] * 2;
	int tt = n;
	while(tt) mx++, tt /= 2;
	for(int i = n; i >= 0; i--) {
		int t = i, len = 0;
		memset(a, 0, sizeof a);
		while(t) {
			a[len++] = t % 2;
			t /= 2;
		}
		t = 0;
		for(int j = 0; j < mx; j++) a[j] ^= 1;
		for(int j = 0; j < mx; j++) if(a[j]) {
			if(t + xp[j] > n) break;
			t += xp[j];
		}
		for(int j = t; j; j = (j - 1) & t) if(!vis[j]) {
			vis[j] = true;
			ans[i] = j;
			break;
		}
	}
	LL res = 0;
	for(int i = 0; i <= n; i++) res += i ^ ans[i];
	printf("%I64d\n", res);
	for(int i = 0; i <= n; i++) printf("%d%c", ans[i], i == n ? '\n' : ' ');
}

int main()
{
	read();
	work();

	return 0;
}