ZOJ 3802 Easy 2048 Again(状压DP)

#include <cstdio>
#include <cstring>
#include <algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<cmath>
using namespace std;
const int maxn = 57;
#define MAXN 100005
#define ll long long

int dp[2][(1 << 14)];
int A[550];

int main()
{
int T;
cin >> T;
while (T--)
{
int n;
cin >> n;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++)
{
scanf("%d", &A[i]);
}
int pos = 1;
int ans = 0;
dp[0][0] = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 0; j<4096 * 2; j++)
{
if (dp[pos ^ 1][j] == -1) continue;
dp[pos][j] = max(dp[pos][j], dp[pos ^ 1][j]);
ans = max(ans, dp[pos][j]);
int t = j;
int q = A[i] - 1;
int sum = A[i];
if ((t&q) == 0)
{
int k = A[i];
while ((t&k))
{
sum += k << 1;
k <<= 1;
}
t &= ~(k - 1);
t |= k;
}
else t = A[i];
dp[pos][t] = max(dp[pos][t], dp[pos ^ 1][j] + sum);
ans = max(ans, dp[pos][t]);
}
pos ^= 1;
}
printf("%d\n", ans);
}
return 0;
}