qq_40634175的博客

Problem Description Nowadays, 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...

Description Given 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...

Problem Description A 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...

原题地址 #include<cstdio> #include<iostream> #include <cstring> #include <algorithm> using namespace std; int a[10],dp[300000]; int main() { int k=1; while(1) { ...

原题地址 #include&amp;amp;amp;amp;lt;iostream&amp;amp;amp;amp;gt; #include&amp;amp;amp;amp;lt;cstdio&amp;amp;amp;amp;gt; #include&amp;amp;amp;amp;lt;cstring&amp;amp;amp;amp;gt; #include&amp;amp;amp;amp;lt;algorithm&amp;amp;a

遇到最优解问题首先要想到就是动态规划（有些最优解问题用的是贪心，也有的人认为贪心是特殊的动态规划，比如最小生成树算法中的Prim算法和Kruskal算法，这两个算法都是不断将权值最小的边添加进去从而实现最优解，但是不是所有贪心都是正确的，贪心算法只有通过证明之后才敢放心使用，而动态规划不需要验证），这道题既是一道经典的动态规划题，也是一道经典的求解最长子序列的题目。动态规划并没有你们想的那么高大...