上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 41 下一页

POJ 1018 Communication System

摘要: Communication SystemTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 20407Accepted: 7253DescriptionWe have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. For each device, we are free to choose from several manufac 阅读全文
posted @ 2013-05-16 17:37 江财小子 阅读(486) 评论(0) 推荐(0) 编辑

poj 2976 Dropping tests

摘要: Dropping testsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4559Accepted: 1542DescriptionIn a certain course, you take n tests. If you get ai out of bi questions correct on test i, your cumulative average is defined to be.Given your test scores and a positive integer k, determine how high 阅读全文
posted @ 2013-05-07 21:45 江财小子 阅读(186) 评论(0) 推荐(0) 编辑

poj 1459 Power Network

摘要: Power NetworkTime Limit: 2000MSMemory Limit: 32768KTotal Submissions: 20026Accepted: 10539DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 阅读全文
posted @ 2013-05-05 16:34 江财小子 阅读(223) 评论(0) 推荐(0) 编辑

hdu 1403 Longest Common Substring

摘要: Problem DescriptionGiven two strings, you have to tell the length of the Longest Common Substring of them.For example:str1 = bananastr2 = cianaicSo the Longest Common Substring is "ana", and the length is 3.InputThe input contains several test cases. Each test case contains two strings, ea 阅读全文
posted @ 2013-05-03 21:47 江财小子 阅读(214) 评论(0) 推荐(0) 编辑

hdu 1811 Rank of Tetris

摘要: Problem Description自从Lele开发了Rating系统,他的Tetris事业更是如虎添翼,不久他遍把这个游戏推向了全球。为了更好的符合那些爱好者的喜好,Lele又想了一个新点子:他将制作一个全球Tetris高手排行榜,定时更新,名堂要比福布斯富豪榜还响。关于如何排名,这个不用说都知道是根据Rating从高到低来排,如果两个人具有相同的Rating,那就按这几个人的RP从高到低来排。终于,Lele要开始行动了,对N个人进行排名。为了方便起见,每个人都已经被编号,分别从0到N-1,并且编号越大,RP就越高。同时Lele从狗仔队里取得一些(M个)关于Rating的信息。这些信息可能 阅读全文
posted @ 2013-05-02 23:35 江财小子 阅读(231) 评论(0) 推荐(0) 编辑

hdu 2874 Connections between cities

摘要: Problem DescriptionAfter World War X, a lot of cities have been seriously damaged, and we need to rebuild those cities. However, some materials needed can only be produced in certain places. So we need to transport these materials from city to city. For most of roads had been totally destroyed durin 阅读全文
posted @ 2013-05-01 17:45 江财小子 阅读(509) 评论(0) 推荐(0) 编辑

hdu 1598 find the most comfortable road

摘要: Problem DescriptionXX 星有许多城市,城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构)进行交流,每条SARS都对行驶在上面的Flycar限制了固定的Speed,同时XX星人对 Flycar的“舒适度”有特殊要求,即乘坐过程中最高速度与最低速度的差越小乘坐越舒服 ,(理解为SARS的限速要求,flycar必须瞬间提速/降速,痛苦呀 ),但XX星人对时间却没那么多要求。要你找出一条城市间的最舒适的路径。(SARS是双向的)。Input输入包括多个测试实例,每个实例包括:第一行有2个正整数n (1<n<= 阅读全文
posted @ 2013-05-01 15:56 江财小子 阅读(268) 评论(0) 推荐(0) 编辑

hdu 2389 Rain on your Parade

摘要: Problem DescriptionYou’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sunny evening, and a soothing wind sends fresh, salty air from the sea. The evening is progressing just as you had imagined. It could be the perfect end of 阅读全文
posted @ 2013-04-25 23:36 江财小子 阅读(276) 评论(0) 推荐(0) 编辑

hdu 2819 Swap

摘要: Problem DescriptionGiven an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all the diagonal entries equal to 1?InputThere are several test cases in the input. The first line of each test case is an integer N (1 <= N <= 100). 阅读全文
posted @ 2013-04-25 22:36 江财小子 阅读(284) 评论(0) 推荐(0) 编辑

hdu 3360 National Treasures

摘要: Problem DescriptionThe great hall of the national museum has been robbed few times recently. Everyone is now worried about the security of the treasures on display. To help secure the hall, the museum contracted with a private security company to provide additional guards to stay in the great hall a 阅读全文
posted @ 2013-04-24 23:25 江财小子 阅读(242) 评论(0) 推荐(0) 编辑
上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 41 下一页