hihoCoder#1044 : 状态压缩·一

http://hihocoder.com/problemset/problem/1044

#include <iostream>
using namespace std;
int N, M, Q;
int W[1010];
int dp[1020][1025];
int countTwo[11] = { 0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023 };
int countOne[1030];
int main()
{
	scanf("%d%d%d", &N, &M, &Q);
	for (int i = 1; i <= N; i++)
		scanf("%d",&W[i]);
	for (int i = 0; i <= countTwo[M]; i++)
	{
		int count = 0, num = i;
		while (num != 0)
		{
			if (num & 1)
			{
				count++;
			}
			num = num >> 1;
		}
		countOne[i] = count;
	}
	int ans = 0;
	for (int i = 1; i <= N;i++)
	{
		for (int j =0; j <1<<M; j++)
		{
			int left = j >> 1;
			int right = (j >> 1) + countTwo[M - 1] + 1;
			int beforei = dp[i - 1][left] > dp[i - 1][right] ? dp[i - 1][left] : dp[i - 1][right];
			if (countOne[j] <= Q&&j&1)
			{
				dp[i][j] = beforei + W[i];
				ans = ans > dp[i][j] ? ans : dp[i][j];
			}
			else
				dp[i][j] = beforei;
		}
	}
	cout << ans << endl;
	return 0;
}