2015暑假多校联合---Expression（区间DP）

题目链接

http://acm.split.hdu.edu.cn/showproblem.php?pid=5396

Problem Description

Teacher Mai has n numbers a1,a2,⋯,anand n−1 operators("+", "-" or "*")op1,op2,⋯,opn−1, which are arranged in the form a1 op1 a2 op2 a3 ⋯ an.

He wants to erase numbers one by one. In i-th round, there are n+1−i numbers remained. He can erase two adjacent numbers and the operator between them, and then put a new number (derived from this one operation) in this position. After n−1 rounds, there is the only one number remained. The result of this sequence of operations is the last number remained.

He wants to know the sum of results of all different sequences of operations. Two sequences of operations are considered different if and only if in one round he chooses different numbers.

For example, a possible sequence of operations for "1+4∗6−8∗3" is 1+4∗6−8∗3→1+4∗(−2)∗3→1+(−8)∗3→(−7)∗3→−21.

Input

There are multiple test cases.

For each test case, the first line contains one number n(2≤n≤100).

The second line contains n integers a1,a2,⋯,an(0≤ai≤109).

The third line contains a string with length n−1 consisting "+","-" and "*", which represents the operator sequence.

Output

For each test case print the answer modulo 109+7.

Sample Input

3 2 1

1 4 6 8 3

+*-*

Sample Output

999999689

Hint

Two numbers are considered different when they are in different positions.

Author

xudyh

Source

2015 Multi-University Training Contest 9

Recommend

wange2014 | We have carefully selected several similar problems for you: 5867 5866 5865 5864 5863

题意：输入n个数，n-1个运算符（只有“+”、“—”、“*”），组成一个算式，给这n-1个运算符赋予不同的运算优先级（运算先后次序），每次得到一个值，求在所有值的和；

思路：区间DP，对于区间[i,j] 分为[i,k] 和[k+1,j] 设[i,k]在不同运算次序下的所有值为X1、X2、X3....Xn 那么dp[i][k]=(X1+X2+X3+...+Xn)

同样设dp[k+1][j]=(Y1+Y2+Y3+....+Ym) 如果第k个运算符为“*” dp[i][j]=X1*(Y1+...+Ym)+...+Xn*(Y1+...+Ym) =dp[i][k]*dp[k+1][j];

如果不是“*” dp[i][j]=dp[i][k]*A[j-1-k]+dp[k+1][j]*A[k-i] A[]表示排列，为什么要乘以排列数呢？分析可知，对于区间[i,k]中的一个值对应区间[k+1][j]的所有值，而后面区间中由运算符优先级得到的值的个数就是后面区间的运算符个数的排列数；

最后要乘上组合数，对于区间[i,j]分为[i,k] [k+1,j]的贡献次数是C[j-i][k-i] 为什么呢？因为前后两个区间的运算优先级对彼此没有影响；

代码如下：

#include <iostream>

#include <algorithm>

#include <cstdio>

#include <cstring>

#include <cmath>

#define eps 1e-8

#define maxn 105

#define inf 0x3f3f3f3f3f3f3f3f

#define IN freopen("in.txt","r",stdin);

using namespace std;

const long long mod=1e9+;

long long a[];

char s[];

long long dp[][];

long long A[];

long long C[][];

int main()

{

    int n;

    A[]=;

    for(long long i=;i<=;i++)  ///排列数；

        A[i]=A[i-]*i%mod;

    for(int i=;i<;i++)         ///组合数；

        C[i][]=;

    C[][]=;

    for(int i=;i<;i++)

    {

        for(int j=;j<=i;j++)

            C[i][j]=(C[i-][j-]+C[i-][j])%mod;

    }

    while(scanf("%d",&n)!=EOF)

    {

        for(int i=;i<=n;i++)

            scanf("%lld",&a[i]);

        scanf("%s",s+);

        memset(dp,,sizeof(dp));

        for(int i=;i<=n;i++)

            dp[i][i]=a[i];

        for(int len=;len<=n;len++)

        {

            for(int i=;i<=n;i++)

            {

                if(i+len->n) break;

                for(int k=i;k<i+len-;k++)

                {

                    long long t;

                    if(s[k]=='*')

                        t=(dp[i][k]*dp[k+][i+len-])%mod;

                    else if(s[k]=='-')

                        t=(dp[i][k]*A[i+len--k]-dp[k+][i+len-]*A[k-i])%mod;

                    else

                        t=(dp[i][k]*A[i+len--k]+dp[k+][i+len-]*A[k-i])%mod;

                    dp[i][i+len-]=(dp[i][i+len-]+t*C[len-][k-i])%mod;

                }

            }

        }

        printf("%lld\n",(dp[][n]%mod+mod)%mod);

    }

    return ;

}

巴特西

2015暑假多校联合---Expression（区间DP）

最新文章

热门文章