![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划DP
文章平均质量分 86
而濡木染
不赶时间也奔跑
展开
-
动态规划复习
题目大意:滑雪智能从高处滑到低处,输出所有的滑雪路径上的最长的那条代码实现:dp公式为dp[i][j]=max(四个可以滑的方向的dp值)=max(maxn,dp[i+movx[t]][j+movy[t]]);#include #include #include using namespace std;int movx[4]= {-1,0,1,0};int movy[4]=原创 2017-05-17 11:44:14 · 372 阅读 · 0 评论 -
HDU Walk (概率DP)
HDU Walk (概率DP):http://acm.hdu.edu.cn/showproblem.php?pid=5001题面描述:Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 996 Accepted Sub原创 2016-04-30 11:28:59 · 570 阅读 · 0 评论 -
POJ 3744 Scout YYF I (矩阵相乘+概率DP)
POJ 3744 Scout YYF I (矩阵相乘+概率DP):http://poj.org/problem?id=3744题面:Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7254 Accepted: 2118DescriptionYY原创 2016-04-30 17:10:42 · 543 阅读 · 0 评论 -
ACdream 1113 The Arrow (概率DP)
ACdream 1113 The Arrow (概率DP):http://acm.hust.edu.cn/vjudge/contest/view.action?cid=114332#problem/E 传送门:nefu题面:Time Limit:1000MS Memory Limit:64000KB 64bit IO Format:%lld & %lluSubm原创 2016-04-30 16:15:41 · 519 阅读 · 0 评论 -
ZOJ 3822 Domination (概率期望)
ZOJ 3822 Domination(概率期望):http://acm.hust.edu.cn/vjudge/contest/view.action?cid=115193#problem/E 传送门:nefu题面描述:Time Limit:8000MS Memory Limit:131072KB 64bit IO Format:%lld & %lluSubmi原创 2016-05-05 13:23:45 · 378 阅读 · 0 评论 -
HDU 5245 Joyful (概率期望)
HDU 5245 Joyful (概率) :http://acm.hdu.edu.cn/showproblem.php?pid=5245 题面描述:Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 877 Accepted原创 2016-05-05 10:40:37 · 881 阅读 · 0 评论 -
HDU 3853 LOOPS (概率DP)
HDU 3853 LOOPS (概率DP)http://acm.hdu.edu.cn/showproblem.php?pid=3853题面:LOOPSTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 4567原创 2016-05-07 10:50:37 · 850 阅读 · 0 评论 -
HDU 5159 Card (概率DP)
HDU 5159 Card (概率DP):http://acm.hdu.edu.cn/showproblem.php?pid=5159 题面描述:CardTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 802原创 2016-05-07 11:36:05 · 887 阅读 · 0 评论 -
算法设计与分析不定期更新的日常之最大子段和四种方法
算法设计与分析不定期更新的日常之最大子段和四种方法:代码实现如下:#include #include ///最大子段和四种方法#include using namespace std;const int maxn=100;int maxsum1(int n,int a[],int &besti,int &bestj)///超级无敌大暴力,复杂度O(n^3){原创 2016-10-02 17:06:26 · 531 阅读 · 0 评论 -
POJ 3071 Football (概率DP)
POJ 3071 Football (概率DP):http://poj.org/problem?id=3071题面:Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4389 Accepted: 2239DescriptionConsider原创 2016-04-30 14:42:03 · 455 阅读 · 0 评论