hdu 5366 The mook jong

最新推荐文章于 2016-07-12 21:22:47 发布

弱菜zc

最新推荐文章于 2016-07-12 21:22:47 发布

阅读量562

点赞数

CC 4.0 BY-SA版权

分类专栏：搜索文章标签： ACM hdu 搜索

本文链接：https://blog.youkuaiyun.com/zchahaha/article/details/51656646

搜索专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一道经典的排列组合问题，通过记忆化搜索的方法来求解特定条件下砖块上放置木匠的数量。该问题要求木匠之间的距离至少为两个砖块，并探讨了如何使用动态规划或记忆化搜索算法来高效地解决这一问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5366

题目：ZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. His backyard consist of n bricks that is 1*1,so it is 1*n。ZJiaQ want to put a mook jong in a brick. because of the hands of the mook jong， the distance of two mook jongs should be equal or more than 2 bricks. Now ZJiaQ want to know how many ways can ZJiaQ put mook jongs legally(at least one mook jong).

Input

There ar multiply cases. For each case, there is a single integer n( 1 < = n < = 60)

Output

Print the ways in a single line for each case.

记忆化搜索或dp

#include <iostream>
#include<bits/stdc++.h>
using namespace std;

long long v[66];

long long dfs(int t)
{
    if(t<1) return 0;
    if(v[t]!=-1)    return v[t];
    if(t==1)
    {
        v[t]=1;
        return v[t];
    }
    v[t]=dfs(t-1)+dfs(t-3)+1;
    return v[t];
}

int main()
{
    memset(v,-1,sizeof(v));
    dfs(60);
    int n;
    while(~scanf("%d",&n))
        cout<<v[n]<<endl;
}