2014年08月_键盘崩坏

转载 ACM的你伤不起!!!

劳资六年前开始搞ACM啊！！！！！！！！！！从此踏上了尼玛不归路啊！！！！！！！！！！！！谁特么跟劳资讲算法是程序设计的核心啊！！！！！！尼玛除了面试题就没见过用算法的地方啊！！！！！！谁再跟劳资讲算法之美算法的力量，劳资一本算法导论拍死你啊！！！！！！！！那是搞ACM的入门书啊！！！！特么的入门书就一千多页啊！！！！！！！还没有习题答案啊，学完了你特么都不知道

2014-08-15 15:16:04 410

原创 HDU2602:Bone Collector(01背包)

Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grav

2014-08-15 13:32:11 367

原创 HDU2546：饭卡(01背包)

Problem Description电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格以及卡上的余额，问最少可使卡上的余额为多少。

2014-08-15 13:18:37 375

原创 HDU4512：吉哥系列故事——完美队形I(LICS)

#include #include #include using namespace std;int a[505],b[505],dp[505],n,m,cnt;int mark[505][505],ans[505];int LICS(){ int i,j,MAX,k; memset(dp,0,sizeof(dp)); memset(mark,0,size

2014-08-14 17:24:47 325

原创 HDU4521：小明系列问题——小明序列(推广LIS（带区间）)

Problem Description　　大家都知道小明最喜欢研究跟序列有关的问题了，可是也就因为这样，小明几乎已经玩遍各种序列问题了。可怜的小明苦苦地在各大网站上寻找着新的序列问题，可是找来找去都是自己早已研究过的序列。小明想既然找不到，那就自己来发明一个新的序列问题吧！小明想啊想，终于想出了一个新的序列问题，他欣喜若狂，因为是自己想出来的，于是将其新序列问题命名为“小明序列”。

2014-08-13 23:32:04 576

原创 HDU1950：Bridging signals(LIS)

Problem Description'Oh no, they've done it again', cries the chief designer at the Waferland chip factory. Once more the routing designers have screwed up completely, making the signals on the chi

2014-08-13 19:57:28 297

原创 HDU1025:Constructing Roads In JGShining's Kingdom(LIS(dp+二分))

摘：链接：http://acm.hdu.edu.cn/forum/read.php?tid=15580&fpage=0&page=1假设存在一个序列d[1..9] = 2 1 5 3 6 4 8 9 7，可以看出来它的LIS长度为5。下面一步一步试着找出它。我们定义一个序列B，然后令 i = 1 to 9 逐个考察这个序列。此外，我们用一个变量Len来记录现在最长算到多

2014-08-13 14:08:30 436

原创 HDU1257：最少拦截系统(LIS)

Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里

2014-08-13 10:07:08 379

转载最长公共上升子序列算法

最长公共上升子序列（LCIS）的O(n^2)算法预备知识：动态规划的基本思想，LCS，LIS。问题：字符串a，字符串b，求a和b的LCIS（最长公共上升子序列）。首先我们可以看到，这个问题具有相当多的重叠子问题。于是我们想到用DP搞。DP的首要任务是什么？定义状态。1定义状态F[i][j]表示以a串的前i个字符b串的前j个字符且以b[j]为结尾构成的LCIS的长度。为什么是这个

2014-08-13 09:16:26 478

原创 HDU1513(LCS+滚动数组)

Problem DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, dete

2014-08-11 22:14:53 688

原创 HDU1503:Advanced Fruits(LCS+最优解输出)

Problem DescriptionThe company "21st Century Fruits" has specialized in creating new sorts of fruits by transferring genes from one fruit into the genome of another one. Most times this method doe

2014-08-11 21:54:08 472

原创 HDU1003：Max Sum

Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +

2014-08-11 16:20:06 311

原创 HDU1159：Common Subsequence(LCS)

Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there e

2014-08-10 23:17:57 320

原创 HDU1212:Big Number(大数求模)

#include#includeint main(){ char a[1000]; int b,len; while(~scanf("%s%d",a,&b)) { len=strlen(a); int mod=0; for(int i=0;i<len;i++) { mod*=10; mod+=a[i]-'0'; mod=mod%b; } }

2014-08-09 22:47:24 397

原创 HDU1164:Eddy's research I(素数筛选法)

Problem DescriptionEddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can't wri

2014-08-09 22:07:42 413

原创 HDU1097:A hard puzzle(快速幂求模)

Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.

2014-08-09 21:18:18 1377

原创 HDU1061：Rightmost Digit(快速幂取模)

Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N. InputThe input contains several test cases. The first line of the input is a single in

2014-08-09 18:54:37 362

原创 HDU1019:Least Common Multiple

Problem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 1

2014-08-09 17:54:09 365

原创 HDU1690:Bus System(Floyd)

Problem DescriptionBecause of the huge population of China, public transportation is very important. Bus is an important transportation method in traditional public transportation system. And it’s

2014-08-07 20:02:18 297

原创 HDU3631：Shortest Path(Floyd)

Problem DescriptionWhen YY was a boy and LMY was a girl, they trained for NOI (National Olympiad in Informatics) in GD team. One day, GD team’s coach, Prof. GUO asked them to solve the following s

2014-08-07 17:49:24 262

原创 hdu2923

#include#include#includeusing namespace std;const int inf=999999999;int n,c,m;int tu[105][105];char str[1005][100];int cnt;mapmat;void Floyd(){ int i,j,k; for(k=1;k<=n;k++) for(i=1;i<=n

2014-08-07 16:30:18 425

原创 HDU1546：Idiomatic Phrases Game(Dijkstra)

Problem DescriptionTom is playing a game called Idiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain meaning. This game will give Tom two idioms. He should bui

2014-08-07 13:27:25 344

原创 HDU：1317 XYZZY（SPFA处理正环+Flody判断点连通）

Problem DescriptionIt has recently been discovered how to run open-source software on the Y-Crate gaming device. A number of enterprising designers have developed Advent-style games for deployment o

2014-08-06 23:00:22 406

原创 HDU1595:find the longest of the shortest(Dijkstra)

Problem DescriptionMarica is very angry with Mirko because he found a new girlfriend and she seeks revenge.Since she doesn't live in the same city, she started preparing for the long journey.We kn

2014-08-06 16:31:08 368

原创 HDU1245:Saving James Bond(Floyd)

Problem DescriptionThis time let us consider the situation in the movie "Live and Let Die" in which James Bond, the world's most famous spy, was captured by a group of drug dealers. He was sent to

2014-08-06 13:55:45 387

原创 HDU2807:The Shortest Path(矩阵乘法+快速矩阵比较+Floyd)

Problem DescriptionThere are N cities in the country. Each city is represent by a matrix size of M*M. If city A, B and C satisfy that A*B = C, we say that there is a road from A to C with distance

2014-08-05 22:59:49 384

原创 HDU2833:WuKong(Floyd 最大共同公共点)

Problem DescriptionLiyuan wanted to rewrite the famous book “Journey to the West” (“Xi You Ji” in Chinese pinyin). In the original book, the Monkey King Sun Wukong was trapped by the Buddha for 500

2014-08-05 21:03:17 450

原创 HDU1599：find the mincost route(Floyd最小无向环)

Problem Description杭州有N个景区，景区之间有一些双向的路来连接，现在8600想找一条旅游路线，这个路线从A点出发并且最后回到A点，假设经过的路线为V1,V2,....VK,V1,那么必须满足K>2,就是说至除了出发点以外至少要经过2个其他不同的景区，而且不能重复经过同一个景区。现在8600需要你帮他找一条这样的路线，并且花费越少越好。 Input

2014-08-05 11:17:21 385

原创 HDU3339:In Action(Dijkstra+01背包)

Problem DescriptionSince 1945, when the first nuclear bomb was exploded by the Manhattan Project team in the US, the number of nuclear weapons have soared across the globe.Nowadays,the crazy b

2014-08-05 09:54:02 411

原创 HDU2680：Choose the best route(Dijkstra)

Problem DescriptionOne day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city

2014-08-05 08:50:17 350

原创 HDU1301:Jungle Roads（prime）

Problem DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overt

2014-08-04 21:36:17 331

原创 HDU1233:还是畅通工程

Problem Description某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 当N为0时，输入结束

2014-08-04 20:28:10 338

原创 HDU1232：畅通工程

Problem Description某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一定有直接的道路相连，只要互相间接通过道路可达即可）。问最少还需要建设多少条道路？Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是城镇数目N ( < 1000

2014-08-04 19:53:59 352

原创 HDU1162：Eddy's picture

#include#include#include#define inf 9999999struct node{ double x,y;}p[110];int vis[110];double di[110],map[110][110];double len(node a,node b){ return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(

2014-08-04 17:05:06 310

原创 hdu1102:Constructing Roads(prime)

Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connec

2014-08-04 16:10:32 317

原创 HDU1863:畅通工程(kruskal)

Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。经过调查评估，得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序，计算出全省畅通需要的最低成本。Input测试输入包含若干测试用例。每个测试用例的第1行给出评估的道路条数 N、村庄数目M ( 行

2014-08-04 15:18:01 554

原创 hdu3371： Connect the Cities

Problem DescriptionIn 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The government

2014-08-04 10:51:02 294

原创 HDU1217:Arbitrage(SPFA)

Problem DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US

2014-08-01 14:50:13 275

原创 HDU1548：A strange lift(Dijkstra)

Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When

2014-08-01 11:52:16 310

原创 HDU3790：最短路径问题(Dijkstra)

Problem Description给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。 Input输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长度为d，花费为p。最后一行是两个数 s,t;起点s，终点。n和m为

2014-08-01 10:18:43 344

BOX2D 物理游戏编程初学者指南_扫描版

【数学部分解题集】Introduction to 3D Game Programming with DirectX 11

空空如也