The King’s Ups and Downs_组合dp

The king has guards of all different heights. Rather than line them up in increasing or decreasing height order, he wants to line them up so each guard is either shorter than the guards next to him or taller than the guards next to him (so the heights go up and down along the line). For example, seven guards of heights 160, 162, 164, 166, 168, 170 and 172 cm. could be arranged as:


or perhaps:


The king wants to know how many guards he needs so he can have a different up and down order at each changing of the guard for rest of his reign. To be able to do this, he needs to know for a given number of guards, n, how many different up and down orders there are:

For example, if there are four guards: 1, 2, 3,4 can be arrange as:

1324, 2143, 3142, 2314, 3412, 4231, 4132, 2413, 3241, 1423

For this problem, you will write a program that takes as input a positive integer n, the number of guards and returns the number of up and down orders for n guards of differing heights.

Input The first line of input contains a single integer P, (1 <= P <= 1000), which is the number of data sets that follow. Each data set consists of single line of input containing two integers. The first integer, D is the data set number. The second integer, n (1 <= n <= 20), is the number of guards of differing heights.
Output For each data set there is one line of output. It contains the data set number (D) followed by a single space, followed by the number of up and down orders for the n guards.
Sample Input
4
1 1
2 3
3 4
4 20
Sample Output
1 1
2 4
3 10
4 740742376475050
#include<bits/stdc++.h>
#define ll long long
using namespace std;

ll c[25][25],d[25][2];

void init(){
    for(int i=1;i<=20;i++){
        c[i][0]=c[i][i]=1;
        for(int j=1;j<i;j++)
        c[i][j]=c[i-1][j]+c[i-1][j-1];
    }
    d[0][1]=d[0][0]=d[1][0]=d[1][1]=1;
    for(int i=2;i<=20;i++){
        ll cur=0;
        for(int j=0;j<i;j++){
            cur+=d[j][0]*d[i-j-1][1]*c[i-1][j];
        }
        d[i][0]=d[i][1]=cur/2;
    }
}


int main()
{
    int n,cnt;
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    init();
    int t;
    cin>>t;
    while(t--){
        int id;
        scanf("%d%d",&id,&n);
        if(n==1)printf("%d 1\n",id);
        else printf("%d %lld\n",id,d[n][0]*2);
    }
    return 0;
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/ujn20161222/article/details/79966531
个人分类: dp
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭