出栈序列统计

题目链接:http://xyoj.xynu.edu.cn/problem.php?id=1330

递归+模拟

#include<iostream>
#include<cstdio>
using namespace std;
int ans;
void dfs(int in,int out) {
	if(out==0)
		ans++;
	else if(in==0)
		dfs(in+1,out-1);
	else if(out) {
		dfs(in+1,out-1);
		dfs(in-1,out);
	}
}
int main() {
	int n;
	while(cin>>n) {
		ans=0;
		dfs(0,n);
		cout<<ans<<endl;
	}
}