- 博客(26)
- 资源 (28)
- 收藏
- 关注
原创 hdu 4751 Divide Groups 2—sat问题 还是未理解
This year is the 60th anniversary of NJUST, and to make the celebration more colorful, Tom200 is going to invite distinguished alumnus back to visit and take photos. After carefully planning, Tom200 announced his activity plan, one that contains two char
2015-04-28 21:59:12 956
原创 hdu 1281 棋盘游戏 二分匹配
Problem Description小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。 所以现在Gardon想让小希来解决一个更难的问题,在保证尽量多的“车”的前提下,棋盘里有些格子是可以避开的,也就是说,不在这些格子上放车,也可以保证尽量多的“车”被放下。但是某些格子若不放子,就无法保证放尽量多
2015-04-28 17:20:12 1136
原创 hdu 2444 The Accomodation of Students 判断是否为二分图+最大匹配
Problem DescriptionThere 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 and C know each other.Now you are given all pairs of stu
2015-04-28 10:05:29 923
原创 hdu Courses 1083 二分匹配 ,匈牙利算法。。水题
Problem DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students that satisfies simultaneously the condition
2015-04-28 09:05:49 1147
原创 hdu 2063 过山车 二分图的最大匹配模板。。感觉模板代码很简洁
Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partner,Grass只愿意和linle或LL做partner,PrincessSnow愿意和水域浪子或伪酷儿做partner。考虑到经费问题,boss刘决定只让找到partner的人去坐过山车,其他的人
2015-04-27 17:59:07 834
原创 hdu2181 哈密顿绕行世界问题 哈密顿图。。水题
Problem Description一个规则的实心十二面体,它的 20个顶点标出世界著名的20个城市,你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m<=20,m>=1.m=0退出. Output输出从第m个城市出发经过每个城市1次又回到m的所有路线,如有多条路线,按字典序输出,每行1条路线.每行首先输出是第几条路线.然后个一个: 后列出经过的城市.参看Sample output
2015-04-27 12:56:32 987
原创 hdu 3018 Ant Trip 算是一道欧拉通路的题目吧~
Problem DescriptionAnt Country consist of N towns.There are M roads connecting the towns.Ant Tony,together with his friends,wants to go through every part of the country. They intend to visit every road , and every road must be visited for exact one t
2015-04-27 11:17:04 921
原创 hdu 1878 欧拉回路 水题。测试数据貌似有点问题
Problem Description欧拉回路是指不令笔离开纸面,可画过图中每条边仅一次,且可以回到起点的一条回路。现给定一个图,问是否存在欧拉回路? Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是节点数N ( 1 < N < 1000 )和边数M;随后的M行对应M条边,每行给出一对正整数,分别是该条边直接连通的两个节点的编号(节点从1到N编号)。当N为0时输入结束。 Output每个测试用例的输出占一行,若欧拉回路存在则输出1,否则输出0。
2015-04-27 09:46:39 1464
原创 hdu 3065 病毒侵袭持续中 AC自动机模板题 ,,一A。
Problem Description小t非常感谢大家帮忙解决了他的上一个问题。然而病毒侵袭持续中。在小t的不懈努力下,他发现了网路中的“万恶之源”。这是一个庞大的病毒网站,他有着好多好多的病毒,但是这个网站包含的病毒很奇怪,这些病毒的特征码很短,而且只包含“英文大写字符”。当然小t好想好想为民除害,但是小t从来不打没有准备的战争。知己知彼,百战不殆,小t首先要做的是知道这个病毒网站特征:包含多少不同的病毒,每种病毒出现了多少次。大家能再帮帮他吗? Input第一行,一个整数N(1<=N<=100
2015-04-22 18:52:26 803
原创 hdu 2087 剪花布条 KMP水题。。
Problem Description一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符,则不再进行工作。 Output输出能从花纹布中剪出的最多小饰条个数,如果一块都没有,那就老老实实输出
2015-04-22 15:10:35 1515
原创 hdu 2222 Keywords Search AC自动机模板题
Problem DescriptionIn the modern time, Search engine came into the life of everybody like Google, Baidu, etc.Wiskey also wants to bring this feature to his image retrieval system.Every image have a long description, when users type some keywords to find
2015-04-22 14:08:23 894
原创 hdu 3572 Task Schedule 最大流 Dinic算法,,卡时间。。建图非常有讲究
Problem DescriptionOur geometry princess XMM has stoped her study in computational geometry to concentrate on her newly opened factory. Her factory has introduced M new machines in order to process the coming N tasks. For the i-th task, the factory has to
2015-04-20 21:10:13 1390
原创 hdu 3545 Flow Problem 最大流模板题 EK+Dinic算法两种代码AC
Problem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph. InputThe first line of input contains an integer T, denoting the number of test cas
2015-04-16 09:12:20 1321
原创 hdu 1532 Drainage Ditches 网络最大流模板 EK + Dinic两种算法AC
Problem DescriptionEvery 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 to regrow. Thus, Farmer John has built a set of drainag
2015-04-15 18:57:22 897
原创 hdu 2069 Coin Change 背包。本来打算用母函数再写一遍的,发现代码极其相似,就没写
Problem DescriptionSuppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of money.For example, if we have 11 cents, then we can make changes with one 10-cent coin a
2015-04-08 15:16:19 1008
原创 hdu 2203 亲和串 KMP入门
Problem Description人随着岁数的增长是越大越聪明还是越大越笨,这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考,因为他在很小的时候就知道亲和串如何判断了,但是发现,现在长大了却不知道怎么去判断亲和串了,于是他只好又再一次来请教聪明且乐于助人的你来解决这个问题。亲和串的定义是这样的:给定两个字符串s1和s2,如果能通过s1循环移位,使s2包含在s1中,那么我们就说s2 是s1的亲和串。 Input本题有多组测试数据,每组数据的第一行包含输入字符串s1,第二行包含
2015-04-08 08:38:49 1135
原创 蓝桥杯 历届试题 小朋友排队 树状数组实现
n 个小朋友站成一排。现在要把他们按身高从低到高的顺序排列,但是每次只能交换位置相邻的两个小朋友。 每个小朋友都有一个不高兴的程度。开始的时候,所有小朋友的不高兴程度都是0。 如果某个小朋友第一次被要求交换,则他的不高兴程度增加1,如果第二次要求他交换,则他的不高兴程度增加2(即不高兴程度为3),依次类推。当要求某个小朋友第k次交换时,他的不高兴程度增加k。 请问,要让所有小朋友按从低到高排队,他们的不高兴程度之和最小是多少。 如果有两个小朋友身高一样,则他们谁站在谁前面是没有关系的
2015-04-07 20:05:58 1094
原创 hdu 1226 超级密码 BFS 挺不错的题啊!
Problem DescriptionIgnatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息:密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0<=N<=5000)的正整数倍(如果存在多个满足条件的数,那么最小的那个就是密码),如果这样的密码存在,那么当你输入它以后门将打开,如果不存在这样的密码......那就把门炸了吧.注意:由于宝藏的历史久远,当时的系统最多只能保存500位
2015-04-07 19:54:17 1222
原创 hdu 1429 胜利大逃亡(续) 搜索+状态压缩,,不错的题。
Problem DescriptionIgnatius再次被魔王抓走了(搞不懂他咋这么讨魔王喜欢)……这次魔王汲取了上次的教训,把Ignatius关在一个n*m的地牢里,并在地牢的某些地方安装了带锁的门,钥匙藏在地牢另外的某些地方。刚开始Ignatius被关在(sx,sy)的位置,离开地牢的门在(ex,ey)的位置。Ignatius每分钟只能从一个坐标走到相邻四个坐标中的其中一个。魔王每t分钟回地牢视察一次,若发现Ignatius不在原位置便把他拎回去。经过若干次的尝试,Ignatius已画出整个地牢
2015-04-07 10:07:47 892
原创 hdu 2962 Trucking 最短路+二分。。Dijkstra+SPFA两种算法实现。
Problem DescriptionA certain local trucking company would like to transport some goods on a cargo truck from one place to another. It is desirable to transport as much goods as possible each trip. Unfortunately, one cannot always use the roads in the shor
2015-04-04 18:03:04 785
原创 hdu 1023 Train Problem II 这题运用到大数相乘+大数相除+卡特兰数
Problem DescriptionAs we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains can get out of the railway. InputThe input contains sever
2015-04-03 16:40:45 1005
原创 hdu 1022 Train Problem I (栈)
As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a problem, there is only o
2015-04-03 11:28:46 749
原创 hdu 1711 Number Sequence KMP模板题~~~
Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], ...... , a[K + M - 1] = b[M]. If th
2015-04-03 09:45:52 751
原创 hdu 2211 杀人游戏 ~~~应该算是数学问题~~
Problem Description不知道你是否玩过杀人游戏,这里的杀人游戏可没有法官,警察之类的人,只有土匪,现在已知有N个土匪站在一排,每个土匪都有一个编号,从1到N,每次杀人时给定一个K值,从还活着的土匪中,编号从小到大的找到K个人,然后杀掉,继续往下,直到找遍,然后继续从剩下的土匪中,编号从小到大找到第K个活着的土匪,然后杀掉。比如,现在有10个土匪,K为3,第一次杀掉3,6,9号的土匪,第二次杀掉4,8号土匪,第三次杀掉5号土匪,第四次杀掉7号土匪,第五次杀掉10号土匪,我们看到10号土匪是最
2015-04-02 21:13:20 1388
原创 poj 2311 Cutting Game SG函数的运用 唉,,,
Urej loves to play various types of dull games. He usually asks other people to play with him. He says that playing those games can show his extraordinary wit. Recently Urej takes a great interest in a new game, and Erif Nezorf becomes the victim. To get a
2015-04-02 08:41:37 1099
原创 poj 2975 Nim 尼姆博弈,求取胜方案数
Nim is a 2-player game featuring several piles of stones. Players alternate turns, and on his/her turn, a player’s move consists of removing one or more stones from any single pile. Play ends when all the stones have been removed, at which point the last p
2015-04-01 15:11:56 1071
mail.jar和activation.jar
2015-11-29
javaMail文档
2015-11-29
现代编译原理(虎书,包含c版和java版中英文,源码,全书答案
2015-07-28
java api1.6中文文档
2015-07-24
EditPlus V3.6.0.740中文破解版
2015-07-24
cocos2d-x3.3 坦克大战
2015-07-07
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人