随笔分类 -  ACM-HDU

上一页 1 2 3 4 下一页
hdu1025 Constructing Roads In JGShining's Kingdom（最长上升子序列 + 二分处理）
摘要：Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8812Accepted Submission(s): 2513Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two 阅读全文
posted @ 2012-08-01 10:15 mtry 阅读(1402) 评论(0) 推荐(0)
hdu1055 Color a Tree（贪心）
摘要：Color a TreeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 563Accepted Submission(s): 206Problem DescriptionBob is very interested in the data structure of a tree. A tree is a directed graph in which a special node is singled out, called the " 阅读全文
posted @ 2012-07-31 08:27 mtry 阅读(2277) 评论(1) 推荐(0)
hdu3177 Crixalis's Equipment（贪心）
摘要：Crixalis's EquipmentTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1379Accepted Submission(s): 559Problem DescriptionCrixalis - Sand King used to be a giant scorpion(蝎子) in the deserts of Kalimdor. Though he's a guardian of Lich King now, 阅读全文
posted @ 2012-07-30 11:26 mtry 阅读(1728) 评论(0) 推荐(1)
hdu4315 Climbing the Hill（博弈论）
摘要：Climbing the HillTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 356Accepted Submission(s): 145Problem DescriptionAlice and Bob are playing a game called "Climbing the Hill". The game board consists of cells arranged vertically, as the fi 阅读全文
posted @ 2012-07-28 23:18 mtry 阅读(1632) 评论(1) 推荐(0)
hdu4312 Meeting point-2
摘要：Meeting point-2Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 154Accepted Submission(s): 96Problem DescriptionIt has been ten years since TJU-ACM established. And in this year all the retired TJU-ACMers want to get together to celebrate the tenth 阅读全文
posted @ 2012-07-26 23:33 mtry 阅读(429) 评论(0) 推荐(0)
hdu4311 Meeting point-1
摘要：Meeting point-1Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 447Accepted Submission(s): 151Problem DescriptionIt has been ten years since TJU-ACM established. And in this year all the retired TJU-ACMers want to get together to celebrate the tenth 阅读全文
posted @ 2012-07-26 23:22 mtry 阅读(860) 评论(0) 推荐(1)
hdu2255 奔小康赚大钱（二分匹配 KM）模板 邻接矩阵
摘要：奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 822Accepted Submission(s): 379Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。另一方面,村长和另外 阅读全文
posted @ 2012-07-25 22:01 mtry 阅读(248) 评论(0) 推荐(0)
hdu2063 过山车（匈牙利）模板
摘要：过山车Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4754Accepted Submission(s): 2056Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和XHD或PQK做partner，Grass只 阅读全文
posted @ 2012-07-24 21:13 mtry 阅读(272) 评论(0) 推荐(0)
hdu4302 Holedox Eating（multiset）
摘要：Holedox EatingTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 983Accepted Submission(s): 335Problem DescriptionHoledox is a small animal which can be considered as one point. It lives in a straight pipe whose length is L. Holedox can only move alon 阅读全文
posted @ 2012-07-21 16:26 mtry 阅读(382) 评论(0) 推荐(0)
hdu1569 方格取数(2) （最大流 E_K）模板 邻接表
摘要：方格取数(2)Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2580Accepted Submission(s): 777Problem Description给你一个m*n的格子的棋盘，每个格子里面有一个非负数。从中取出若干个数，使得任意的两个数所在的格子没有公共边，就是说所取数所在的2个格子不能相邻，并且取出的数的和最大。Input包括多个测试实例，每个测试实例包括2整数m,n和m*n个非负数(m<=50,n<=50)Out 阅读全文
posted @ 2012-07-18 23:35 mtry 阅读(788) 评论(0) 推荐(0)
hdu1565 方格取数(1)（最大流 E_K）模板 邻接矩阵
摘要：方格取数(1)Time Limit: 1000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2076Accepted Submission(s): 792Problem Description给你一个n*n的格子的棋盘，每个格子里面有一个非负数。从中取出若干个数，使得任意的两个数所在的格子没有公共边，就是说所取的数所在的2个格子不能相邻，并且取出的数的和最大。Input包括多个测试实例，每个测试实例包括一个整数n 和n*n个非负数(n<=20)Output对于每个测试 阅读全文
posted @ 2012-07-18 23:30 mtry 阅读(1317) 评论(0) 推荐(0)
hdu4255 A Famous Grid（素数表+BFS）
摘要：A Famous GridTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 172Accepted Submission(s): 64Problem DescriptionMr. B has recently discovered the grid named "spiral grid".Construct the grid like the following figure. (The grid is actually i 阅读全文
posted @ 2012-07-16 23:15 mtry 阅读(711) 评论(1) 推荐(0)
hdu4252 A Famous City （set）
摘要：A Famous CityTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 115Accepted Submission(s): 62Problem DescriptionAfter Mr. B arrived in Warsaw, he was shocked by the skyscrapers and took several photos. But now when he looks at these photos, he finds 阅读全文
posted @ 2012-07-16 22:36 mtry 阅读(822) 评论(0) 推荐(0)
hdu1384 Intervals（差分约束+spfa）
摘要：不知不觉这已经是第100篇随笔了……IntervalsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1532Accepted Submission(s): 569Problem DescriptionYou are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.Write a program that:> reads the number o 阅读全文
posted @ 2012-07-13 22:25 mtry 阅读(1088) 评论(0) 推荐(0)
hdu1534 Schedule Problem（差分约束+spfa）
摘要：Schedule ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 641Accepted Submission(s): 245Special JudgeProblem DescriptionA project can be divided into several parts. Each part should be completed continuously. This means if a part should take 阅读全文
posted @ 2012-07-13 22:15 mtry 阅读(747) 评论(0) 推荐(1)
hdu1176 免费馅饼（dp）
摘要：免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13360Accepted Submission(s): 4410Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人，所以他只能 阅读全文
posted @ 2012-07-10 22:38 mtry 阅读(241) 评论(0) 推荐(0)
hdu1116 Play on Words（并查集）
摘要：Play on WordsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2570Accepted Submission(s): 821Problem DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because 阅读全文
posted @ 2012-07-10 21:05 mtry 阅读(2333) 评论(0) 推荐(1)
hdu1142 A Walk Through the Forest（dijkstra + 记忆化搜索）
摘要：A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3018Accepted Submission(s): 1101Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a 阅读全文
posted @ 2012-07-10 20:25 mtry 阅读(3092) 评论(1) 推荐(1)
hdu1081 To The Max （最大子矩阵和）
摘要：To The MaxTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4592Accepted Submission(s): 2165Problem DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater locat 阅读全文
posted @ 2012-07-08 16:49 mtry 阅读(2074) 评论(0) 推荐(0)
hdu1480 钥匙计数之二
摘要：钥匙计数之二Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 733Accepted Submission(s): 434Problem Description一把钥匙有N个槽，2<N<26槽深为1，2，3，4,5,6。每钥匙至少有3个不同的深度且相连的槽其深度之差不得为5。求这样的钥匙的总数。 Input本题无输入Output对2<N<26，输出满足要求的钥匙的总数。Sample OutputN=3: 104 N=4: 阅读全文
posted @ 2012-07-07 19:23 mtry 阅读(486) 评论(0) 推荐(0)

上一页 1 2 3 4 下一页