![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM_动态规划
乐于消遣
这个作者很懒,什么都没留下…
展开
-
HDOJ 5001 walk 概率dp
AC代码如下:以dp[wa# include # include # include # include # include # include # include # include # include # include # define inf 0x3f3f3f3f using namespace std; typedef long long ll; double dp[2][55][原创 2014-09-13 22:09:13 · 530 阅读 · 0 评论 -
UVA 674 - Coin Change
又是背包问题,由于刚入门,想了很久 # include # include long d[7500]; int main() { int coin[5]={50,25,10,5,1}; memset(d,0,sizeof(d)); d[0]=1; for(int i=0;i<5;i++) { for(int j=1;j<7500;j++) { if(j-coin[i]>原创 2014-03-20 21:34:01 · 665 阅读 · 0 评论 -
UVAlive 4394
题目大意:给定两个长度相等,只有xi原创 2014-10-16 22:14:47 · 638 阅读 · 0 评论