zoj 1503 - One Person "The Price is Right"
来源:互联网 发布:淘宝清洗后有什么影响 编辑:程序博客网 时间:2024/06/06 04:59
题目:有一个数字让你猜,你有k次机会,并且有k个保险如果猜的低了会高度你低了,
高了会告诉你高了,并且失去一k保险(k=0时猜高了就会失败),现在问你能猜的数字范围。
分析:dp,二维动态规划。按保险k和猜的机会n递增的方向dp。
状态:f(G,L)为有G次猜的机会,L个保险时确定的数字范围(1~N);
转移方程:F(G,L)= G(G-1,L)+ 1 + F(G-1,L-1){ 猜低 + 猜中 + 猜高 };
边界条件:如果没有失败机会的话,只能从1开始向后猜;
说明:(2011-10-03 16:32)。
#include <iostream>#include <cstdlib>using namespace std;long long F[ 31 ][ 31 ];int main(){ for ( long long i = 0 ; i <= 30 ; ++ i ) F[ i ][ 0 ] = i; for ( int i = 0 ; i <= 30 ; ++ i ) F[ 0 ][ i ] = 0L; for ( int i = 1 ; i <= 30 ; ++ i ) for ( int j = 1 ; j <= 30 ; ++ j ) F[ i ][ j ] = F[ i-1 ][ j ]+F[ i-1 ][ j-1 ]+1; int G,L,C = 1; while ( cin >> G >> L && ( G || L ) ) cout << "Case " << C++ << ": " << F[ G ][ L ] << endl; return 0;}
0 0
- zoj 1503 - One Person "The Price is Right"
- zoj 1503 One Person "The Price is Right"
- zoj1503-One Person "The Price is Right"
- 1525. One Person "The Price is Right"
- ZOJ One Person Game
- One Person Game ZOJ
- One Person Game ZOJ
- zoj 3329 One Person Game
- ZOJ 3593 One Person Game
- ZOJ 3329 One Person Game
- ZOJ 3329 One Person Game
- ZOJ 3329 One Person Game
- ZOJ-3593 One Person Game
- ZOJ 3329 One Person Game
- ZOJ 3329One Person Game
- ZOJ 3593 One Person Game
- ZOJ-3329-One Person Game
- One obvious criticism is that the price of breadth is depth
- EL表达式的逻辑运算和关系运算
- 挨踢职场求生法则
- mybatis 使用 and和or联合查询
- 重载“流提取运算符—— >> ”
- UVA 6662 The Last Ant(模拟退火)
- zoj 1503 - One Person "The Price is Right"
- 链接器工具错误 "LNK2026 XXX模块对于 SAFESEH 映像是不安全的" LINK : fatal error LNK1104: 无法打开文件“LIBCD.lib”
- LeetCode -- Surrounded Regions
- 数据结构 第一章 绪论 思维导图
- 第一篇文章
- 6661 Equal Sum Sets(DP)
- lightoj 1024 Eid
- poj1207(3n+1)
- 构造函数