02 2015 档案

【策略】UVa 11389 - The Bus Driver Problem

摘要：题意：有司机，下午路线，晚上路线各n个。给每个司机恰好分配一个下午路线和晚上路线。给出行驶每条路线的时间，如果司机开车时间超过d，则要付加班费d×r。问如何分配路线才能使加班费最少。虽然代码看起来很水。但一直不理解为什么，找到这位大神的解释与大家参考。http://www.cnblogs.com/A... 阅读全文

posted @ 2015-02-28 18:31 LLGemini 阅读(377) 评论(0) 推荐(0)

【策略】UVa 1344 - Tian Ji -- The Horse Racing（田忌赛马）

摘要：Here is a famous story in Chinese history.That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse... 阅读全文

posted @ 2015-02-28 16:54 LLGemini 阅读(392) 评论(0) 推荐(0)

【推理】UVa 10771 - Barbarian tribes

摘要：Barbarian tribesIn a lost land two primitive tribes coexist: Gareds and Kekas. Every summer solstice they meet and compete to decide which tribe will... 阅读全文

posted @ 2015-02-28 11:53 LLGemini 阅读(169) 评论(0) 推荐(0)

【字符串排序，技巧！】UVa 10905 - Children’s Game

摘要：There are lots of number games for children. These games are pretty easy to play but not so easy to make. We will discuss about an interesting game he... 阅读全文

posted @ 2015-02-27 19:22 LLGemini 阅读(186) 评论(0) 推荐(0)

【二分答案+贪心】UVa 1335 - Beijing Guards

摘要：Beijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial City Wall, the Inner City Wall, and finally the Outer C... 阅读全文

posted @ 2015-02-27 14:46 LLGemini 阅读(366) 评论(0) 推荐(0)

【二分答案+贪心】解决“最小值最大”问题(UVa 12124 - Assemble)

摘要：Problem A - AssembleTime limit: 2 secondsRecently your team noticed that the computer you use to practice for programming contests is not good enough ... 阅读全文

posted @ 2015-02-27 10:48 LLGemini 阅读(526) 评论(0) 推荐(0)

【汉诺塔问题】UVa 10795 - A Different Task

摘要：【经典汉诺塔问题】 汉诺（Hanoi）塔问题：古代有一个梵塔，塔内有三个座A、B、C，A座上有64个盘子，盘子大小不等，大的在下，小的在上。有一个和尚想把这64个盘子从A座移到B座，但每次只能允许移动一个盘子，并且在移动过程中，3个座上的盘子始终保持大盘在下，小盘在上。在移动过程中可以利用B座，要... 阅读全文

posted @ 2015-02-26 22:54 LLGemini 阅读(422) 评论(0) 推荐(0)

【模拟】UVa 1030 - Image Is Everything

摘要：1030 - Image Is EverythingTime limit: 3.000 secondsYour new company is building a robot that can hold small lightweight objects. The robot will have t... 阅读全文

posted @ 2015-02-25 18:30 LLGemini 阅读(257) 评论(0) 推荐(0)

#291 div.2

摘要：A.水题数字翻转，将每一位大于等于5的数字t翻转成9-t，注意不要有前导0，且翻转后数字的位数不变（即9999->9000...刚开始以为应该翻转成0了= =） 1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 ... 阅读全文

posted @ 2015-02-15 16:59 LLGemini 阅读(155) 评论(0) 推荐(0)

【区间选点问题】uva 10148 - Advertisement

摘要：区间选点问题，即数轴上有n个闭区间[l1i, ri],取尽量少的点，使得每个区间内都至少有一个点。The Department of Recreation has decided that it must be more profitable, and it wants to sell advert... 阅读全文

posted @ 2015-02-05 17:43 LLGemini 阅读(290) 评论(0) 推荐(0)

【区间覆盖问题】uva 10020 - Minimal coverage

摘要：可以说是区间覆盖问题的例题...Note:区间包含+排序扫描； 要求覆盖区间[s, t]; 1、把各区间按照Left从小到大排序，如果区间1的起点大于s，则无解（因为其他区间的左起点更大）；否则选择起点在s的最长区间; 2、选择区间[li, ri]后，新的起点应更新为ri，并且忽略所有区间在r... 阅读全文

posted @ 2015-02-04 10:20 LLGemini 阅读(206) 评论(0) 推荐(0)

【Fibonacci】BestCoder #28B Fibonacci

摘要：FibonacciTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 795Accepted Submission(s): 213Problem Des... 阅读全文

posted @ 2015-02-02 00:34 LLGemini 阅读(196) 评论(0) 推荐(0)