Ural 1225. Flags DP
来源:互联网 发布:中国网络空间安全网 编辑:程序博客网 时间:2024/06/05 17:17
1225. Flags
Time limit: 1.0 second
Memory limit: 64 MB
Memory limit: 64 MB
On the Day of the Flag of Russia a shop-owner decided to decorate the show-window of his shop with textile stripes of white, blue and red colors. He wants to satisfy the following conditions:
- Stripes of the same color cannot be placed next to each other.
- A blue stripe must always be placed between a white and a red or between a red and a white one.
Determine the number of the ways to fulfill his wish.
Example. For N = 3 result is following:
Input
N, the number of the stripes, 1 ≤ N ≤ 45.
Output
M, the number of the ways to decorate the shop-window.
Sample
3
4
Problem Source: 2002-2003 ACM Central Region of Russia Quarterfinal Programming Contest, Rybinsk, October 2002
其实算不上dp,只能算得上是递推
动态转移方程:f[i]=f[i-1]+f[i-2]
i表示i个布条,如果第i个为红或者白时,只需在前一个状态+1,如果第i个为蓝时,需要在i-2的状态加一个白或者红
注意数据类型!必须用long long
#include<iostream>using namespace std;int main(){ int n; long long f[50]; cin>>n; f[1]=2; f[2]=2; for(int i=3; i<=n; i++) f[i]=f[i-1]+f[i-2]; cout<<f[n]<<endl; return 0;}
- Ural 1225. Flags DP
- ural 1225.Flags(简单dp)
- URAL 1225. Flags (dp)
- Ural 1225 Flags(DP)
- URAL 1225Flags dp练习
- ural 1225. Flags
- URAL 1225. Flags
- URAL 1225 Flags (DP动态规划)
- 1225. Flags URAL 解题报告
- Timus 1225. Flags dp
- ural 1225 Flags
- Ural 1225 Flags
- URAL-1225 Flags
- URAL1225 Flags, DP
- ural 1692 Flags for Provinces 解题报告
- URAL 1225(Flags)简单递推
- URAL 1225-Flags(规律递推)
- ural 1119【dp+精度】
- TestNG 教程3 – 忽略测试方法
- nanopb的使用
- html样式标签是不能绑定事件
- PAT 1020 Tree Traversals
- ARM9开Icache代码
- Ural 1225. Flags DP
- LINUX下的IIC驱动(三)
- 解决ubuntu上打不开Rubymine的问题
- 安卓:进程与线程(线程篇)
- ROS ccny_vision: image_transport
- JSP起源、JSP的运行原理、JSP的执行过程
- NYOJ 47-过河问题
- tomcat6 安装apache-solr-3.6.1
- ClassLoader的应用