CodeForces 148C Terse princess(模拟)

太坑了。。。这题

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<string.h>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<vector>
using namespace std;
typedef long long ll;
int ans[120];
#define sp  system("pause")
#define mt(dp) memset(dp,0,sizeof dp)



int main()
{
	int n, a, b;
	cin >> n >> a >> b;
	if (n == 1 && a == 0 && b == 0)
	{
		cout << 1 << endl;
		return 0;
	}
	ans[0] = 1; int minn = ans[0]; int maxx = ans[0]; int nowmaxx = ans[0];
	if (a + b + 1 < n)
		ans[1] = 1, maxx = 2;
	else if (b == 0)
	{
		cout << -1 << endl;
		return 0;
	}
	for (int i = (a + b + 1 < n ? 2 : 1); i<n; i++)
	{
		while (b>0)
		{
			b--;
			ans[i] = maxx + 1;
			maxx += ans[i];
			nowmaxx = max(nowmaxx, ans[i]);
			i++;
		}
		while (a>0)
		{
			a--;
			ans[i] = nowmaxx + 1;
			nowmaxx = max(nowmaxx, ans[i]);
			i++;
		}
		if (i >= n)break;
		ans[i] = minn;
	}
	if (nowmaxx>50000)
	{
		cout << "-1\n";
		return 0;
	}
	for (int i = 0; i<n; i++)
	{
		if (i)printf(" ");
		printf("%d", ans[i]);
	}
	printf("\n");
	//sp;
	return 0;
}