算法竞赛进阶指南- A Decorative Fence

void func1(int n,int &c)
{

	int dp[21][21][2] = { { { 0 } } };
	dp[1][1][0] = dp[1][1][1] = 1;
	vector<int> used(21, 0);

	for (int i = 2; i <= 20; i++)
	{
		for (int j = 1; j <= i; j++)
		{
			for (int p = j; p <= i - 1; p++)
			{
				dp[i][j][0] += dp[i-1][p][1];
			}
			for (int p = 1; p <= j-1; p++)
			{
				dp[i][j][1] += dp[i - 1][p][0];
			}
		}
	}

	int last = 0;
	int k = 0;
	for (int i = 1; i <= n; i++)
	{
		if (dp[n][i][1] >= c)
		{
			last = i;
			k = 1;
			break;
		}
		else c -= dp[n][i][1];

		if (dp[n][i][0] >= c)
		{
			last = i;
			k = 0;
			break;
		}
		else c -= dp[n][i][0];
	}

	used[last] = 1;
	cout << last << ",";
	for (int i = 2; i <= n; i++)
	{
		k ^= 1;

		int j = 0;
		for (int len = 1; len <= n; len++)
		{
			if (used[len])continue;
			j++;

			if ((k == 0 && len<last) || (k == 1 && len>last)){
				if (dp[n - i + 1][j][k] >= c)
				{
					last = len;

					used[last] = 1;
					cout << last << ",";
					break;
				}
				else{
					c -= dp[n - i + 1][j][k];
				}
			}
		}

	}
	return;

}