hdu 5396 Expression

区间dp
调一调出样例就过了

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
const int maxn=1e2+10;
ll dp[maxn][maxn];
int n;int a[maxn];char str[maxn];
ll A[maxn];ll c[maxn][maxn];
void init(){
    A[0]=1;
    A[1]=1;
    for(int i=2;i<=100;i++){
        A[i]=A[i-1]*i%mod;
    }
    for(int i=0;i<=100;i++) c[i][0]=1;
    for(int i=1;i<=100;i++){
        for(int j=1;j<=100;j++){
            c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
        }
    }
}
int main(){
    init();
    while(scanf("%d",&n)!=EOF){
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);dp[i][1]=a[i];
        }
    //  cout<<" = == = "<<dp[3][1]<<endl;
        scanf("%s",str+1);int len=strlen(str+1);
        for(int j=2;j<=n;j++){
            for(int i=1;i+j<=n+1;i++){
                for(int k=i;k<i+j-1;k++){
                    ll ans=0;
                    if(str[k]=='*'){
                        ans=(ans+dp[i][k+1-i]*dp[k+1][i+j-k-1]%mod)%mod;
                    }
                    else if(str[k]=='+'){

                        ans=(ans+dp[i][k+1-i]*A[i+j-k-2]%mod+dp[k+1][i+j-k-1]*A[k-i]%mod)%mod;
                    }
                    else if(str[k]=='-'){

                        ans=(ans+dp[i][k+1-i]*A[i+j-k-2]%mod-dp[k+1][i+j-k-1]*A[k-i]%mod)%mod;
                        if(ans<mod) ans+=mod;
                    }
                    ans=(ans*c[j-2][k-i]%mod);
                    dp[i][j]=(dp[i][j]+ans)%mod;
                }
            }
        }
    //  cout<<"  = = == = = "<<dp[1][2]<<endl;
    /*  for(int i=1;i<=n;i++){
            for(int j=1;j+i<=n+1;j++){
                cout<<" i= "<<i<<" j= "<<j<<" dp[i]= "<<dp[i][j]<<endl;
            }
        }*/
        printf("%lld\n",dp[1][n]);
    }

}