随笔分类 -  动态规划

上一页 1 2
HDU - 4472 Count
摘要：Prof. Tigris is the head of an archaeological team who is currently in charge of an excavation in a site of ancient relics. This site contains relics 阅读全文
posted @ 2018-01-28 10:01 euzmin 阅读(263) 评论(0) 推荐(0)
HDU - 5115 Dire Wolf （非原创）
摘要：Dire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves appear to originate from Draenor. 阅读全文
posted @ 2018-01-27 16:51 euzmin 阅读(149) 评论(0) 推荐(0)
HDU - 5119 Happy Matt Friends
摘要：Matt has N friends. They are playing a game together. Each of Matt’s friends has a magic number. In the game, Matt selects some (could be zero) of his 阅读全文
posted @ 2018-01-27 15:03 euzmin 阅读(136) 评论(0) 推荐(0)
HDU - 4455 Substrings（非原创）
摘要：XXX has an array of length n. XXX wants to know that, for a given w, what is the sum of the distinct elements’ number in all substrings of length w. F 阅读全文
posted @ 2018-01-25 11:16 euzmin 阅读(261) 评论(0) 推荐(0)
codefforces 877B
摘要：B. Nikita and stringtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Nikita found the str 阅读全文
posted @ 2017-10-24 16:01 euzmin 阅读(284) 评论(0) 推荐(0)
codeforces 5E（非原创）
摘要：E. Bindian Signalizing time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output E. Bindian Signal 阅读全文
posted @ 2017-10-22 22:10 euzmin 阅读(510) 评论(2) 推荐(0)
codeforces 5C
摘要：C. Longest Regular Bracket Sequence time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. L 阅读全文
posted @ 2017-10-19 23:28 euzmin 阅读(298) 评论(0) 推荐(0)
二分搜索模板
摘要：1 int bs1(int x,int y,int t) { //二分求上界 2 while(x <= y) { 3 int mid = x + (y - x) / 2; 4 if(num[mid] <= t) x = mid + 1; 5 else y = mid - 1; 6 } 7 retur 阅读全文
posted @ 2017-09-30 23:17 euzmin 阅读(224) 评论(0) 推荐(0)
hdu-2955 Robberies
摘要：The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become t 阅读全文
posted @ 2017-08-20 21:54 euzmin 阅读(152) 评论(0) 推荐(0)
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 阅读全文
posted @ 2017-08-20 20:23 euzmin 阅读(214) 评论(0) 推荐(0)
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 i 阅读全文
posted @ 2017-08-17 13:38 euzmin 阅读(265) 评论(0) 推荐(0)
hdu-1024 Max Sum Plus Plus
摘要：Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now y 阅读全文
posted @ 2017-08-16 19:31 euzmin 阅读(181) 评论(0) 推荐(0)
haut-1282 ykc想吃好吃的
摘要：1282: ykc想吃好吃的 题目描述 一天，ykc在学校闲的无聊，于是决定上街买点吃的，ykc很懒，本来就不是很像逛街，于是找来了czl帮他买，这里应该有滑稽，而czl也不愿为ykc买东西吃，但是ykc很强势，非让他去买，呢没办法了，然而czl还有很多事要做，没呢么多时间帮ykc，而这条小吃街又很 阅读全文
posted @ 2017-08-08 23:34 euzmin 阅读(163) 评论(0) 推荐(0)
haut-1281 邪能炸弹(dp)
摘要：1281: 邪能炸弹 题目描述 正在入侵艾泽拉斯的古尔丹偶然间得到了一颗邪能炸弹，经过研究，他发现这是一颗威力极其巨大且难以控制的炸弹。但是精通邪能的古尔丹突然有了一个大胆的想法，他对炸弹进行了一些小小的改造。这使得炸弹需要n天的充能才能爆炸，在这n天中，每天炸弹的邪能值都会产生波动，波动值为xi， 阅读全文
posted @ 2017-08-04 21:05 euzmin 阅读(229) 评论(0) 推荐(0)
zoj-3872 Beauty of Array （dp）
摘要：]Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the array. Now Edward wants to 阅读全文
posted @ 2017-08-03 21:32 euzmin 阅读(210) 评论(0) 推荐(0)
hdu-1159 1087 1257（dp）
摘要：本文就最长公共子序列，最长连续递增子序列的长度，最大连续递增子序列的值进行对比。 hdu-1159: Common Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) 阅读全文
posted @ 2017-05-15 22:27 euzmin 阅读(251) 评论(0) 推荐(0)

上一页 1 2