Sothan

HDU 1260 Tickets Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early as possible.A good approach, reducing th

HDU 1069 Monkey and Banana 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 blocks. If the monkey is clever enough, it shall

HDU 1087 Super Jumping! Jumping! Jumping! 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 now.

HDU 1257 最少拦截系统 某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.

I. 成群的触手Time Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: lldJava class name: MainSubmitStatusPID: 2040饭团学长终于成功的约了漂亮的大姐姐，但是漂亮大姐姐来约会的路上要经过一片沼泽地，

Mondriaan's DreamTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 15097 Accepted: 8710DescriptionSquares and rectangles fascinated the famous Dutch painter

Zero EscapeProblem DescriptionZero Escape, is a visual novel adventure video game directed by Kotaro Uchikoshi (you may hear about ever17?) and developed by Chunsoft.Stilwell is enjoying

两种方法求LCS（最长公共子序列） 求LCS长度，打印输出一个LCS。 二维数组和滚动数组的动态规划。

dp[i][j]： 前 i 行 满足每一行都有 1 且满足有 j 列有1，考虑第i行的放置情况状态转移：  dp[0][0] = 1LL; for(int i = 1; i <= n; ++i) { for(int j = 1; j <= m; ++j) { for(int k = 0; k <= m; ++k) { if(dp[i