动态规划
cjmHK
努力做得更好
展开
-
Super Jumping! Jumping! Jumping!(HDU-1087)
Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you...原创 2019-04-22 00:02:41 · 157 阅读 · 0 评论 -
Combine String(HDU-5707)
DescriptionGiven three strings aaa, bbb and ccc, your mission is to check whether ccc is the combine string of aaa and bbb.A string ccc is said to be the combine string of aaa and bbb if and only if...原创 2019-04-24 20:42:54 · 126 阅读 · 0 评论 -
Monkey and Banana(HDU-1069)
Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some...原创 2019-04-05 11:48:43 · 120 阅读 · 0 评论 -
Dividing(HDU-1059)
原题地址#include<cstdio>#include<iostream>#include <cstring>#include <algorithm>using namespace std;int a[10],dp[300000];int main(){ int k=1; while(1) { ...原创 2019-03-24 21:41:42 · 169 阅读 · 0 评论 -
Strategic Game(HDU-1054)
原题地址#include&amp;amp;amp;lt;iostream&amp;amp;amp;gt;#include&amp;amp;amp;lt;cstdio&amp;amp;amp;gt;#include&amp;amp;amp;lt;cstring&amp;amp;amp;gt;#include&amp;amp;amp;lt;algorithm&amp;a原创 2019-03-16 00:04:24 · 163 阅读 · 0 评论 -
最少拦截系统(HDU-1257)
遇到最优解问题首先要想到就是动态规划(有些最优解问题用的是贪心,也有的人认为贪心是特殊的动态规划,比如最小生成树算法中的Prim算法和Kruskal算法,这两个算法都是不断将权值最小的边添加进去从而实现最优解,但是不是所有贪心都是正确的,贪心算法只有通过证明之后才敢放心使用,而动态规划不需要验证),这道题既是一道经典的动态规划题,也是一道经典的求解最长子序列的题目。动态规划并没有你们想的那么高大...原创 2018-09-24 20:48:53 · 1635 阅读 · 0 评论