Ural_1260. Nudnik Photographer(DP)
2011-10-09 13:15
337 查看
/*题意:对1到N这些数进行排列,1在最左边,相邻的两个数之差不能超过2,求有多少种排列方法? 思路:已知1在最左边,跟1相邻的只能是2、3。当2跟1相邻时后边的部分就是dp[n-1] 。当3在1后边,2在3后边时,前三位确定,剩下的就是dp[n-3]。最后剩下一种情况,再加1。 dp[i] = dp[i-1] + dp[i-3] + 1;*/ #include <iostream> #include <fstream> using namespace std; const int N = 60; long long dp ; int main(){ //fstream cin("data.in"); dp[0] = 1; dp[1] = 1; dp[2] = 2; for(int i = 3; i <= 55; i++){ dp[i] = dp[i-1] + dp[i-3] + 1; } int n; while(cin >> n){ cout << dp[n-1] << endl; } return 0; }
相关文章推荐
- 【dp 挺棒的】URAL - 1260 Nudnik Photographer
- Ural 1260. A nudnik photographer(dp)
- 递推DP URAL 1260 Nudnik Photographer
- Ural 1260. Nudnik Photographer DP
- ural 1260. Nudnik Photographer(dp)
- 【URAL 1260】 DP (dfs打表之后找规律也行)
- Ural 1260 A nudnik photographer(DP)
- Ural 1260 A nudnik photographer(DP)
- HDU 1260:Tickets(DP)
- Ural 1018 Binary Apple Tree 树形dp
- [DP] HDU 1260
- ural1223 鹰蛋(dp优化)
- ural Binary Lexicographic Sequence (dp + dfs)
- URAL 1577. E-mail(简单二维dp)
- Ural 1009. K-based Numbers DP
- URAL 1167. Bicolored Horses(DP)
- Ural 1018 Binary Apple Tree (树形dp)
- Ural 1057. Amount of Degrees(数位DP)
- ural 1114,计数dp
- ural 1057(数位dp)