poj2279 线性dp

#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
using namespace std;
int lim[];
ll dp[][][][][];
int main(){
    int n;
    while(scanf("%d",&n)==){
        memset(lim,,sizeof lim);
        memset(dp,,sizeof dp);
        for(int i=;i<=n;i++) scanf("%d",&lim[i]);
        dp[][][][][]=;
        for(int i=;i<=lim[];i++){
            for(int j=;j<=lim[];j++){
                if(j>i)continue;//j>i这种状态不可能成立
                for(int k=;k<=lim[];k++){
                    if(k>j || k>i)continue;
                    for(int l=;l<=lim[];l++){
                        if(l>k||l>j||l>i)continue;
                        for(int m=;m<=lim[];m++){
                            if(m>l || m>k || m>j || m>i)continue;
                            if(i+<=lim[]) dp[i+][j][k][l][m]+=dp[i][j][k][l][m];
                            if(j+<=lim[]) dp[i][j+][k][l][m]+=dp[i][j][k][l][m];
                            if(k+<=lim[]) dp[i][j][k+][l][m]+=dp[i][j][k][l][m];
                            if(l+<=lim[]) dp[i][j][k][l+][m]+=dp[i][j][k][l][m];
                            if(m+<=lim[]) dp[i][j][k][l][m+]+=dp[i][j][k][l][m];
                        }
                    }
                }
            }
        }
        printf("%lld\n",dp[lim[]][lim[]][lim[]][lim[]][lim[]]);
    }
}