模板
BYSora
这个作者很懒,什么都没留下…
展开
-
poj3308——Paratroopers(最小割)
DescriptionIt is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth are informed by their spies that the invaders of Mars wan原创 2017-05-02 20:03:14 · 2175 阅读 · 0 评论 -
poj3041——Asteroids(二分图,匈牙利算法)
DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conv原创 2015-11-29 10:38:20 · 440 阅读 · 0 评论 -
hdu2544——最短路(最短路径模板)
Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗?Input输入包括多组数据。每组数据第一行是两个整数N、M(N<=100,M<=10000),N表示成都的大街上有几个路口,标号为1的路口是商店所在地,标号原创 2016-02-04 17:04:35 · 462 阅读 · 0 评论 -
hdu3790——最短路径问题
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为原创 2016-03-30 16:59:20 · 369 阅读 · 0 评论 -
hdu1233——还是畅通工程(最小生成树)
Problem Description 某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input 测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( < 100 );随后的N(N-1)/2行对原创 2016-05-01 20:24:56 · 512 阅读 · 0 评论 -
poj1125——Stockbroker Grapevine(floyd算法)
DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in t原创 2016-05-04 11:10:37 · 600 阅读 · 0 评论 -
poj2186——Popular Cows(tarjan算法)
DescriptionEvery cow’s dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) ordered pairs of the form (A, B) that tell y原创 2016-05-04 16:55:09 · 982 阅读 · 0 评论 -
poj1679——The Unique MST(次小生成树,Kruskal)
DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a su原创 2016-05-07 16:04:21 · 2260 阅读 · 0 评论 -
poj1860——Currency Exchange(Eellman-Ford+权值为正的环路)
DescriptionSeveral currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies.原创 2016-08-10 18:21:50 · 1099 阅读 · 0 评论 -
hdu1532——Drainage Ditches(网络流模板)
Problem Description Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time原创 2016-05-06 20:14:52 · 1148 阅读 · 1 评论 -
poj2516——Minimum Cost(最小费用最大流)
DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M supply原创 2016-10-31 19:42:04 · 683 阅读 · 0 评论 -
hdu4292——Food(SAP+拆点)
Problem Description You, a part-time dining service worker in your college’s dining hall, are now confused with a new problem: serve as many people as possible. The issue comes up as people in yo原创 2016-11-11 20:03:25 · 339 阅读 · 0 评论 -
蓝桥杯算法提高——6-17复数四则运算
设计复数库,实现基本的复数加减乘除运算。 输入时只需分别键入实部和虚部,以空格分割,两个复数之间用运算符分隔;输出时按a+bi的格式在屏幕上打印结果。参加样例输入和样例输出。 注意考虑特殊情况,无法计算时输出字符串”error”。 样例输入 2 4 * -3 2 样例输出 -14-8i 样例输入 3 -2 + -1 3 样例输出 2+1i算是比较全面了,先存着防止以后再去原创 2017-04-05 16:47:25 · 639 阅读 · 0 评论 -
poj3070——Fibonacci(矩阵快速幂)
DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …An alt原创 2017-03-29 16:52:23 · 939 阅读 · 0 评论 -
poj1113——Wall(凸包)
DescriptionOnce upon a time there was a greedy King who ordered his chief Architect to build a wall around the King’s castle. The King was so greedy, that he would not listen to his Architect’s proposa原创 2017-02-26 16:16:55 · 1274 阅读 · 0 评论 -
poj1942——Paths on a Grid(求阶乘)
DescriptionImagine you are attending your math lesson at school. Once again, you are bored because your teacher tells things that you already mastered years ago (this time he’s explaining that (a+b)2=a原创 2017-03-01 20:47:06 · 936 阅读 · 0 评论 -
poj2996——Help Me with the Game(模拟)
DescriptionYour task is to read a picture of a chessboard position and print it in the chess notation. InputThe input consists of an ASCII-art picture of a chessboard with chess pieces on positions de原创 2017-02-13 13:47:40 · 274 阅读 · 0 评论 -
poj2653——Pick-up sticks(判断线段是否相交)
DescriptionStan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such that th原创 2016-12-09 20:40:34 · 777 阅读 · 0 评论 -
hdu1087——Super Jumping! Jumping! Jumping!(最大递增子序列和)
Problem Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you原创 2016-11-18 21:20:14 · 656 阅读 · 0 评论 -
hdu3605——Escape(二分图多重匹配)
Problem Description 2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not fit to live some of the plane原创 2016-11-14 21:38:30 · 765 阅读 · 0 评论 -
poj1511——Invitation Cards(SPFA+邻接表)
DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comed原创 2016-08-13 10:38:44 · 1410 阅读 · 0 评论 -
poj3159——Candies(差分约束+SPFA堆栈)
DescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute the原创 2016-08-13 12:48:07 · 1028 阅读 · 0 评论 -
山东省第三届ACM省赛题——Thrall’s Dream(DFS)
题目描述 We never paid any heed to the ancient prophecies, like fools we clung to the old hatreds, and fought as we had for generations. Until one day the sky rained fire, and a new enemy came upon us. We原创 2016-04-14 20:09:47 · 582 阅读 · 0 评论 -
zoj3861——Valid Pattern Lock(全排列)
Pattern lock security is generally used in Android handsets instead of a password. The pattern lock can be set by joining points on a 3 × 3 matrix in a chosen order. The points of the matrix are regist原创 2016-05-02 16:03:04 · 938 阅读 · 0 评论 -
Lightoj1113——Discover the Web(STL,栈的使用)
Standard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track of the pages that can be re原创 2016-04-18 13:59:27 · 859 阅读 · 0 评论 -
poj2960——S-Nim(SG函数)
DescriptionArthur and his sister Caroll have been playing a game called Nim for some time now. Nim is played as follows: The starting position has a number of heaps, all containing some, not necessari原创 2016-05-11 21:15:20 · 817 阅读 · 0 评论 -
hdu1018——Big Number(大数阶乘,斯特林公式)
Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you ar原创 2016-04-02 10:06:39 · 408 阅读 · 0 评论 -
集合划分问题(斯特林数模板)
Description n个元素的集合{1,2,…,n}可以划分若干个非空子集。例如,当n=4时,集合{1,2,3,4}可以划分为15个不同的非空子集如下:{{1},{2},{3},{4}}, {{1,2},{3},{4}}, {{1,3},{2},{4}}, {{1,4},{2},{3}}, {{2,3},{1},{4}}, {{2,4},{1},{3}}, {{3,4},{1},{原创 2016-04-29 13:38:34 · 1524 阅读 · 0 评论 -
hdu1754——I Hate It(线段树,单点更新,求最大值)
Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input本题目包含多组测试,请处理到文件结束。在每个测试的第一行,有两个正整数 N原创 2016-04-27 20:26:06 · 619 阅读 · 0 评论 -
hdu4135——Co-prime(容斥原理求区间互素)
Problem Description Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N. Two integers are said to be co-prime or relatively prime转载 2016-04-28 15:16:22 · 1028 阅读 · 0 评论 -
hdu4745——Two Rabbits(区间dp,最长回文子序列)
Problem Description Long long ago, there lived two rabbits Tom and Jerry in the forest. On a sunny afternoon, they planned to play a game with some stones. There were n stones on the ground and they w原创 2016-05-13 10:35:08 · 723 阅读 · 0 评论 -
poj1458——Common Subsequence(最长公共子序列)
DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, …, xm > another sequence Z = < z1, z2, …, zk > is a subseq原创 2016-05-27 20:30:37 · 426 阅读 · 0 评论 -
poj2533——Longest Ordered Subsequence(最长递增子序列模板)
DescriptionA numeric sequence of ai is ordered if a1 < a2 < … < aN. Let the subsequence of the given numeric sequence (a1, a2, …, aN) be any sequence (ai1, ai2, …, aiK), where 1 <= i1 < i2 < … < iK <=原创 2016-04-21 15:20:10 · 440 阅读 · 0 评论 -
hdu2444——The Accomodation of Students(判断二分图+匈牙利算法)
Problem Description There are a group of students. Some of them may know each other, while others don’t. For example, A and B know each other, B and C know each other. But this may not imply that A an原创 2016-09-28 19:12:25 · 1140 阅读 · 1 评论 -
hdu2255——奔小康赚大钱(二分图最优匹配+KM算法)
Problem Description 传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。 这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一间房子。 另一方面,村长和另外的村领导希望得到最大的效益,这样村里的机构才会有钱.由于老百姓原创 2016-10-10 19:34:59 · 452 阅读 · 0 评论 -
hdu3555——Bomb(数位dp)
Problem Description The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the current原创 2016-09-21 20:48:17 · 629 阅读 · 0 评论 -
一个筛选法求素数的函数
int p[MAXN],a[MAXN]; //p保存素数,a判断当前数是否为素数void Primer(){ int i,cnt=0,j, k; for(i=2;i<MAXN;++i) //i从2开始遍历 { if(a[i]==0) //a[i]==0说明该i是素数 p[cnt++]=i; //cnt作为地址标志原创 2016-03-14 16:53:14 · 650 阅读 · 0 评论 -
51nod1136——欧拉函数
对正整数n,欧拉函数是少于或等于n的数中与n互质的数的数目。此函数以其首名研究者欧拉命名,它又称为Euler’s totient function、φ函数、欧拉商数等。例如:φ(8) = 4(Phi(8) = 4),因为1,3,5,7均和8互质。Input 输入一个数N。(2 <= N <= 10^9)Output 输出Phi(n)。Input示例 8Output示例 4#include <原创 2016-08-01 17:39:53 · 993 阅读 · 0 评论 -
1~n中所有数的欧拉函数值
摘自刘汝佳的《算法竞赛入门经典》void phi_table(int n,int *phi){ for(int i=2; i<=n; ++i) phi[i]=0; phi[1]=1; for(int i=2; i<=n; ++i) if(!phi[i]) for(int j=i; j<=n; j+=i)原创 2016-08-03 17:42:27 · 5306 阅读 · 0 评论 -
hdu3068——最长回文
Problem Description 给出一个只由小写英文字符a,b,c…y,z组成的字符串S,求S中最长回文串的长度. 回文就是正反读都是一样的字符串,如aba, abba等Input 输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c…y,z组成的字符串S 两组case之间由空行隔开(该空行不用处理) 字符串长度len <= 110000Output 每一行一原创 2016-05-31 20:17:50 · 928 阅读 · 0 评论