题目链接:hdu 5225 Tom and permutation
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 100;
const int mod = 1e9+7;
int N, ans, V[maxn + 5], A[maxn + 5];
ll S[maxn + 5], L[maxn + 5];
int query(int x) {
int ret = 0;
for (int i = 1; i < x; i++) {
if (V[i] == 0)
ret++;
}
return ret;
}
int dfs(int d, int s) {
if (d > N)
return 0;
if (s == 0) {
ans = (ans + S[N-d+1]) % mod;
return L[N-d+1];
} else {
int ret = 0;
for (int i = 1; i <= A[d]; i++) {
if (V[i]) continue;
V[i] = 1;
int s = query(i);
ll temp = dfs(d + 1, i =