URAL - 2018 The Debut Album(状态dp 记忆化搜索)
2017-05-01 18:18
330 查看
#include <iostream> #include <cstdio> using namespace std; //线段树区间更新模板 //不写注释的模板都是傻,1年后保证自己看不懂 const int N = 50005; int dp[2] ;//dp[i][j]代表第j个放i,i为0或者为1 const int mod=1000000007; int main() { int n,a,b; scanf("%d%d%d",&n,&a,&b); dp[0][0]=1; dp[1][0]=1; for(int l=1;l<=n;l++) { for(int i=1;i<=(a>l?l:a);i++) { dp[0][l]+=dp[1][l-i]; dp[0][l]%=mod; } for(int i=1;i<=(b>l?l:b);i++) { dp[1][l]+=dp[0][l-i]; dp[1][l]%=mod; } } printf("%d\n",(dp[0] +dp[1] )%mod); return 0; }
相关文章推荐
- URAL 2018 The Debut Album (DP)
- G - The Debut Album URAL - 2018(dp)
- URAL_2018_The Debut Album(滚动数组DP)
- ☆URAL 2018 The Debut Album (dp 两种写法)
- ural 2018 The Debut Album (dp)
- 【DP】URAL 2018 The Debut Album
- URAL - 2018 The Debut Album dp
- URAL 2018 The Debut Album(dp)
- URAL 2018 The Debut Album(DP)
- URAL 2018. The Debut Album (dp)
- Ural 2018 The Debut Album
- URAL - 2018 The Debut Album
- Ural 2018. The Debut Album
- Ural 2018 The Debut Album
- 2018. The Debut Album
- codeforces (G) The Debut Album dp+滚动数组
- URAL 1167. Bicolored Horses(二维dp或者记忆化搜索)
- HDU 1693 Eat the Trees(插头DP、棋盘哈密顿回路数)+ URAL 1519 Formula 1(插头DP、棋盘哈密顿单回路数)
- HDOJ 4057 - Rescue the Rabbit 简单的AC自动机+状态压缩DP
- poj 3311 Hie with the Pie(状态压缩DP+最短路)