nowcoder51151 Mr. Young's Picture Permutations

链接

点击跳转

题解

从左往右，依次决定每个数字进入第几排，在任何时刻上面的排的人数都要比下面排的人数多或相等

五维$dp$即可

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
ll f[31][31][16][11][8][7], n, lim[10];
int main()
{
    ll i, a[10], tot;
    f[0][0][0][0][0][0]=1;
    while(n=read())
    {
        cl(lim);
        tot=0;
        rep(i,1,n)lim[i]=read(), tot+=lim[i];
        rep(i,1,tot)
            rep(a[1],0,lim[1])
                rep(a[2],0,min(lim[2],a[1]))
                    rep(a[3],0,min(lim[3],a[2]))
                        rep(a[4],0,min(lim[4],a[3]))
                            rep(a[5],0,min(lim[5],a[4]))
                            {
                                auto &F=f[i][a[1]][a[2]][a[3]][a[4]][a[5]];
                                F=0;
                                if(a[1])F+=f[i-1][a[1]-1][a[2]][a[3]][a[4]][a[5]];
                                if(a[2])F+=f[i-1][a[1]][a[2]-1][a[3]][a[4]][a[5]];
                                if(a[3])F+=f[i-1][a[1]][a[2]][a[3]-1][a[4]][a[5]];
                                if(a[4])F+=f[i-1][a[1]][a[2]][a[3]][a[4]-1][a[5]];
                                if(a[5])F+=f[i-1][a[1]][a[2]][a[3]][a[4]][a[5]-1];
                            }
        printf("%lld\n",f[tot][lim[1]][lim[2]][lim[3]][lim[4]][lim[5]]);
    }
    return 0;
}