随笔分类 -  搜索

摘要:Given n non negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpo 阅读全文
posted @ 2018-06-11 10:06 joeylee97 阅读(139) 评论(0) 推荐(0)
摘要:On his trip to Luxor and Aswan, Sagheer went to a Nubian market to buy some souvenirs for his friends and relatives. The market has some strange rules 阅读全文
posted @ 2017-08-21 13:40 joeylee97 阅读(171) 评论(0) 推荐(0)
摘要:The 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, eac 阅读全文
posted @ 2017-08-14 09:54 joeylee97 阅读(155) 评论(0) 推荐(0)
摘要:分数规划问题,是指这样一类问题: 要求f(x)/g(x)的最值,其中f(x),g(x)都是线性函数,而其中被研究的最多的是0-1分数规划,即求这样的一个式子的极值 r=(∑(ci*xi))/(∑(di*xi)),其中xi∈{0,1} 我们可以把这个式子变换一下 z=(∑(ci*xi))-r'*(∑( 阅读全文
posted @ 2017-08-12 11:09 joeylee97 阅读(159) 评论(0) 推荐(0)
摘要:Problem Description Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in holiday, Harry P 阅读全文
posted @ 2017-08-04 10:49 joeylee97 阅读(350) 评论(0) 推荐(0)
摘要:You are given a sequence of n integers a1, a2, ..., an. Determine a real number x such that the weakness of the sequence a1 - x, a2 - x, ..., an - x i 阅读全文
posted @ 2017-08-03 19:50 joeylee97 阅读(311) 评论(0) 推荐(0)
摘要:The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D 阅读全文
posted @ 2017-08-02 16:51 joeylee97 阅读(148) 评论(0) 推荐(0)
摘要:Cleaning Robot Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4952 Accepted: 1921 Description Here, we want to solve path planning for a m 阅读全文
posted @ 2017-06-15 14:30 joeylee97 阅读(334) 评论(0) 推荐(0)
摘要:Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7866 Accepted: 2586 Description The Robot Moving Institute is using a robot in their local 阅读全文
posted @ 2017-06-15 08:59 joeylee97 阅读(197) 评论(0) 推荐(0)
摘要:Description 7月17日是Mr.W的生日,ACM-THU为此要制作一个体积为Nπ的M层生日蛋糕,每层都是一个圆柱体。 设从下往上数第i(1 <= i <= M)层蛋糕是半径为Ri, 高度为Hi的圆柱。当i < M时,要求Ri > Ri+1且Hi > Hi+1。 由于要在蛋糕上抹奶油,为尽可 阅读全文
posted @ 2017-06-11 08:20 joeylee97 阅读(197) 评论(0) 推荐(0)
摘要:Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17324 Accepted: 5835 Special Judge Description My birthday is coming up and traditionally I 阅读全文
posted @ 2017-06-07 17:57 joeylee97 阅读(237) 评论(0) 推荐(0)
摘要:Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 17050 Accepted: 4503 Description When a thin rod of length L is heated n degrees, it expand 阅读全文
posted @ 2017-06-07 17:40 joeylee97 阅读(183) 评论(0) 推荐(0)
摘要:迷宫寻宝(一) 时间限制:1000 ms | 内存限制:65535 KB 难度:4 迷宫寻宝(一) 时间限制:1000 ms | 内存限制:65535 KB 难度:4 一个叫ACM的寻宝者找到了一个藏宝图,它根据藏宝图找到了一个迷宫,这是一个很特别的迷宫,迷宫里有N个编过号的门(N<=5),它们分别 阅读全文
posted @ 2017-05-11 09:00 joeylee97 阅读(696) 评论(0) 推荐(0)
摘要:24 Point game 时间限制:3000 ms | 内存限制:65535 KB 难度:5 24 Point game 时间限制:3000 ms | 内存限制:65535 KB 难度:5 There is a game which is called 24 Point game. In this 阅读全文
posted @ 2017-05-10 20:50 joeylee97 阅读(324) 评论(0) 推荐(0)
摘要:Channel Allocation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15546 Accepted: 7871 Description When a radio station is broadcasting ov 阅读全文
posted @ 2017-04-28 17:50 joeylee97 阅读(150) 评论(0) 推荐(0)
摘要:Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20113 Accepted: 9628 Special Judge Description Sudoku is a very simple task. A square table 阅读全文
posted @ 2017-04-27 21:00 joeylee97 阅读(167) 评论(0) 推荐(0)
摘要:Shredding Company Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6173 Accepted: 3361 Description You have just been put in charge of devel 阅读全文
posted @ 2017-04-27 09:13 joeylee97 阅读(112) 评论(0) 推荐(0)
摘要:Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 12886 Accepted: 6187 Description A university network is composed of N computers. System ad 阅读全文
posted @ 2017-04-26 22:03 joeylee97 阅读(153) 评论(0) 推荐(0)
摘要:Description Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and r 阅读全文
posted @ 2017-04-13 17:21 joeylee97 阅读(164) 评论(0) 推荐(0)
摘要:Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The exciteme 阅读全文
posted @ 2017-04-13 17:05 joeylee97 阅读(198) 评论(0) 推荐(0)