蓝桥杯 未名湖边的烦恼 动态规划

  算法训练 未名湖边的烦恼  

时间限制：1.0s   内存限制：256.0MB

    

问题描述

　　每年冬天，北大未名湖上都是滑冰的好地方。北大体育组准备了许多冰鞋，可是人太多了，每天下午收工后，常常一双冰鞋都不剩。
　　每天早上，租鞋窗口都会排起长龙，假设有还鞋的m个，有需要租鞋的n个。现在的问题是，这些人有多少种排法，可以避免出现体育组没有冰鞋可租的尴尬场面。（两个同样需求的人（比如都是租鞋或都是还鞋）交换位置是同一种排法）

输入格式

　　两个整数，表示m和n

输出格式

　　一个整数，表示队伍的排法的方案数。

样例输入

3 2

样例输出

5

数据规模和约定

　　m,n∈［0,18］
　　问题分析

http://lx.lanqiao.cn/problem.page?gpid=T303

咋一看 没什么思路直接 想到暴力打表

#include<stdio.h>
int dp[19][19]=
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,3,5,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,4,9,14
,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,5,14,28,42,42,0,0,0,0,0,0,0,0,0,0,0,0,0,1,6,20
,48,90,132,132,0,0,0,0,0,0,0,0,0,0,0,0,1,7,27,75,165,297,429,429,0,0,0,0,0,0,0,0
,0,0,0,1,8,35,110,275,572,1001,1430,1430,0,0,0,0,0,0,0,0,0,0,1,9,44,154,429,1001
,2002,3432,4862,4862,0,0,0,0,0,0,0,0,0,1,10,54,208,637,1638,3640,7072,11934,16796,
16796,0,0,0,0,0,0,0,0,1,11,65,273,910,2548,6188,13260,25194,41990,58786,58786,
0,0,0,0,0,0,0,1,12,77,350,1260,3808,9996,23256,48450,90440,149226,208012,208012,
0,0,0,0,0,0,1,13,90,440,1700,5508,15504,38760,87210,177650,326876,534888,742900,
742900,0,0,0,0,0,1,14,104,544,2244,7752,23256,62016,149226,326876,653752,1188640
,1931540,2674440,2674440,0,0,0,0,1,15,119,663,2907,10659,33915,95931,245157,572033,
1225785,2414425,4345965,7020405,9694845,9694845,0,0,0,1,16,135,798,3705,14364
,48279,144210,389367,961400,2187185,4601610,8947575,15967980,25662825,35357670,
35357670,0,0,1,17,152,950,4655,19019,67298,211508,600875,1562275,3749460,8351070,
17298645,33266625,58929450,94287120,129644790,129644790,0,1,18,170,1120,5775,
24794,92092,303600,904475,2466750,6216210,14567280,31865925,65132550,124062000,
218349120,347993910,477638700,477638700};

int total,ks,kj;

void dfs(int k,int kk,int ta)
{
    if(ta==ks+kj)
    {
        total++;
        return ;
    }

    if(k>kk)
    {
        if(kk<kj)
            dfs(k,kk+1,ta+1);
        if(k<ks)
            dfs(k+1,kk,ta+1);
    }
    if(k==kk)
        if(k<ks)
            dfs(k+1,kk,ta+1);
}


int main()
{   /*int i,j;
    for(i=0; i<=18; i++)
    {
        ks=i;
        for(j=0; j<=18; j++)
        {
            kj=j;
            if(j>i) printf("0,");
            else if(i==0)  printf("0,");
            else if(j==0)  printf("1,");
            else
            {
                total=0;
                dfs(0,0,0);
                printf("%d,",total);
            }
        }
    }
    printf("\n");*/
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        printf("%d\n",dp[n][m]);
    }
    return 0;
}

当然我们还得学习一下动态规划的做法

http://www.cnblogs.com/zhaopAC/p/5088856.html

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
int f[20][20];  //f[x][y]表示取A和B个数分别是x,y
int main()
{
    int n,m;
    scanf("%d%d", &n,&m);
    memset(f, 0, sizeof(f));
    for(int i = 1; i <= n; i++)
        f[i][0] = 1;    //两步预处理
    for(int i = 1; i <= m; i++)
        f[0][i] = 1;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            if( i == j )  //如果这一步取的A和B相等，那么一定是这一步取的一个B,上一个状态B要少一个，就是j-1
                f[i][j] = f[i][j - 1];
            else if(i > j)  //如果这一步取的A>B，那么这一步可能是同过取了一个A（f[i-1][j])或者一个B(f[i][j-1])得到的，
            {
                f[i][j] = f[i - 1][j] + f[i][j - 1];
            }
        }
    }
    printf("%d\n", f[n][m]);
    return 0;
}