05 2015 档案

uva 11080
摘要：题意:放最少的士兵去监视所有的道路, 但士兵不可相邻分析:由於不可相邻可以視同為不可同色(分成两种颜色), 对于一個连通图而言, 如果可以用两种颜色涂完,那么较少使用的顏色则是放置士兵的个数。这题要小心有很多连通图 !#include#include#include#include#include#... 阅读全文
posted @ 2015-05-27 14:07 waterfull 阅读(467) 评论(0) 推荐(0) 编辑
uva 11235
摘要：题解：整个数组是非降序的，所有相等元素都会聚集在一起。开一个num数组，用num[i]来记录第i段相等的元素有多少个（也就是说相当于RMQ中的元素值了），num数组的长度就是原数列不同元素的个数（段数）,l数组记录i段元素的上界，r数组记录i段元素的下界，用一个mark数组记录i位置的元素属于第几段... 阅读全文
posted @ 2015-05-27 13:36 waterfull 阅读(208) 评论(0) 推荐(0) 编辑
uva 11748
摘要：题意:有N个人竞选,有M个投票人,每个投票人对竞选者都有个排序.投票人对于两个竞选者,他会投排在前面的竞选者的票.每次有2个竞选人出来竞选,失败者退出,获胜者则回到竞选候选人里,直到最后一人.现在你想要某人S获胜,并且你能随意安排两个人出来竞选.分析:构图,每两个人A,B,若A获的票数大于B,则连A... 阅读全文
posted @ 2015-05-27 12:46 waterfull 阅读(205) 评论(0) 推荐(0) 编辑
STL uva 11991
摘要：题意。。。某个数第n次出现的位置。。。#include#include#include#include#include#include#include#include#include#includeusing namespace std;int n,m;map > mp;int main(){ ... 阅读全文
posted @ 2015-05-27 11:01 waterfull 阅读(131) 评论(0) 推荐(0) 编辑
(KM) uva 11383
摘要：题意： 给定n*n的矩阵，每个格子有个值s[i][j]，现在要求对每行和每列各分配一个值，r[i],c[i]使得对所有的格子都有s[i][j]#include#include#include#include#include#include#include#include#includeusing ... 阅读全文
posted @ 2015-05-27 10:49 waterfull 阅读(268) 评论(0) 推荐(0) 编辑
(树形DP) uva 10859
摘要：题目大意给你一个ｎ个点ｍ条边的无向无环图，在尽量少的节点上放灯，使得所有边都被照亮。每盏灯将照亮以它为一个端点的所有边。在灯的总数最小的前提下，被两盏灯同时被照亮的边数应该尽量大。这题教会了我一个很有用的技巧：有两个所求的值要优化，比如让a尽量小，ｂ也尽量小那么可以转化为让M*a+b尽量小，其中Ｍ应... 阅读全文
posted @ 2015-05-27 10:26 waterfull 阅读(305) 评论(0) 推荐(0) 编辑
codeforces 242C
摘要：C. King's Pathtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe black king is standing on a ch... 阅读全文
posted @ 2015-05-27 09:58 waterfull 阅读(364) 评论(0) 推荐(0) 编辑
(01背包搜索) zoj 3013
摘要：Watashi's BGTime Limit:3 Seconds Memory Limit:65536 KBWatashi is the couch of ZJU-ICPC Team and he is very kind hearted. In ZJU-ICPC summer training c... 阅读全文
posted @ 2015-05-27 09:29 waterfull 阅读(203) 评论(0) 推荐(0) 编辑
uva 10048
摘要：题意：求两点之间路径中的最大值值最小，直接floyd#include#include#include#include#includeusing namespace std;int mp[105][105],n,m,q;void floyd(){ for(int k=1;kmp[k][j]?mp... 阅读全文
posted @ 2015-05-27 09:00 waterfull 阅读(131) 评论(0) 推荐(0) 编辑
（2 sat） hdu 1824
摘要：Let's go homeTime Limit: 10000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1523Accepted Submission(s): 616Probl... 阅读全文
posted @ 2015-05-26 19:47 waterfull 阅读(151) 评论(0) 推荐(0) 编辑
(2sat) hdu 3062
摘要：http://wenku.baidu.com/link?url=xo0rr2Euamxkz3WOs7Nq66hZ4vrYfRQ3FWw98Z-fy37O8fOOBLUOnNpFNfS6WtfrAIUGZG2coxcrZhIqrDsFmLP1PboOr3XIGq9QFwn1b67PartyTime L... 阅读全文
posted @ 2015-05-26 18:41 waterfull 阅读(168) 评论(0) 推荐(0) 编辑
(差分约束系统) poj 1201
摘要：IntervalsTime Limit:2000MSMemory Limit:65536KTotal Submissions:22781Accepted:8613DescriptionYou are given n closed, integer intervals [ai, bi] and n i... 阅读全文
posted @ 2015-05-26 18:12 waterfull 阅读(159) 评论(0) 推荐(0) 编辑
(差分约束系统) poj 2983
摘要：Is the Information Reliable?Time Limit:3000MSMemory Limit:131072KTotal Submissions:11676Accepted:3687DescriptionThe galaxy war between the Empire Drac... 阅读全文
posted @ 2015-05-26 17:44 waterfull 阅读(224) 评论(0) 推荐(0) 编辑
(DP) zoj 3305
摘要：Get SauceTime Limit:5 Seconds Memory Limit:32768 KBIn order to celebrate the 8th anniversary of ZOJ, LCLL goes to a sauce factory to "Get Sauce". The ... 阅读全文
posted @ 2015-05-26 09:38 waterfull 阅读(364) 评论(0) 推荐(0) 编辑
(种子填充法) zoj 3304
摘要：Prison BreakTime Limit:1 Second Memory Limit:32768 KBIn a prison, there areR*Crooms, and there are N prisoners in it, each in a room. For example: (R=... 阅读全文
posted @ 2015-05-26 09:11 waterfull 阅读(410) 评论(0) 推荐(0) 编辑
(DP) bzoj 1218
摘要：1218: [HNOI2003]激光炸弹Time Limit:10 SecMemory Limit:162 MBSubmit:1292Solved:621[Submit][Status][Discuss]Description一种新型的激光炸弹，可以摧毁一个边长为R的正方形内的所有的目标。现在地图上... 阅读全文
posted @ 2015-05-25 19:20 waterfull 阅读(146) 评论(0) 推荐(0) 编辑
（找规律） bzoj 1235
摘要：【bzoj1345】[Baltic2007]序列问题Sequence2014年3月23日4512Description对于一个给定的序列a1, …, an，我们对它进行一个操作reduce(i)，该操作将数列中的元素ai和ai+1用一个元素max(ai，ai+1)替代，这样得到一个比原来序列短的新序... 阅读全文
posted @ 2015-05-25 19:11 waterfull 阅读(839) 评论(0) 推荐(0) 编辑
(区间操作) bzoj 2054
摘要：2054: 疯狂的馒头Time Limit:10 SecMemory Limit:162 MBSubmit:449Solved:175[Submit][Status]DescriptionInput第一行四个正整数N，M，p，qOutput一共输出N行，第i行表示第i个馒头的最终颜色（如果最终颜色是... 阅读全文
posted @ 2015-05-25 18:38 waterfull 阅读(144) 评论(0) 推荐(0) 编辑
poj 3687
摘要：Labeling BallsTime Limit:1000MSMemory Limit:65536KTotal Submissions:11523Accepted:3313DescriptionWindy hasNballs of distinct weights from 1 unit toNun... 阅读全文
posted @ 2015-05-25 17:42 waterfull 阅读(251) 评论(0) 推荐(0) 编辑
(度序列) poj 1659
摘要：Frogs' NeighborhoodTime Limit:5000MSMemory Limit:10000KTotal Submissions:8215Accepted:3491Special JudgeDescription未名湖附近共有N个大小湖泊L1,L2, ...,Ln(其中包括未名湖)，... 阅读全文
posted @ 2015-05-25 16:19 waterfull 阅读(506) 评论(0) 推荐(0) 编辑
(DFS)poj 1129
摘要：Channel AllocationTime Limit:1000MSMemory Limit:10000KTotal Submissions:12983Accepted:6649DescriptionWhen a radio station is broadcasting over a very ... 阅读全文
posted @ 2015-05-25 15:59 waterfull 阅读(155) 评论(0) 推荐(0) 编辑
(最优比例生成树) poj 2728
摘要：Desert KingTime Limit:3000MSMemory Limit:65536KTotal Submissions:21855Accepted:6103DescriptionDavid the Great has just become the king of a desert cou... 阅读全文
posted @ 2015-05-25 15:39 waterfull 阅读(121) 评论(0) 推荐(0) 编辑
(BFS) poj 3635
摘要：Full Tank?Time Limit:1000MSMemory Limit:65536KTotal Submissions:6724Accepted:2194DescriptionAfter going through the receipts from your car trip throug... 阅读全文
posted @ 2015-05-25 15:13 waterfull 阅读(152) 评论(0) 推荐(0) 编辑
(最短路和次短路) poj 1923
摘要：SightseeingTime Limit:2000MSMemory Limit:65536KTotal Submissions:7601Accepted:2700DescriptionTour operator Your Personal Holiday organises guided bus ... 阅读全文
posted @ 2015-05-25 14:34 waterfull 阅读(377) 评论(0) 推荐(0) 编辑
(tarjan) poj 1904
摘要：King's QuestTime Limit:15000MSMemory Limit:65536KTotal Submissions:7838Accepted:2841Case Time Limit:2000MSDescriptionOnce upon a time there lived a ki... 阅读全文
posted @ 2015-05-25 11:58 waterfull 阅读(140) 评论(0) 推荐(0) 编辑
(tarjan+SPFA求最长路) poj 3114
摘要：Countries in WarTime Limit:1000MSMemory Limit:65536KTotal Submissions:2803Accepted:843DescriptionIn the year 2050, after different attempts of the UN ... 阅读全文
posted @ 2015-05-25 11:25 waterfull 阅读(157) 评论(0) 推荐(0) 编辑
(tajan缩点+SPFA求最长路) poj 3160
摘要：Father Christmas flymouseTime Limit:1000MSMemory Limit:131072KTotal Submissions:2887Accepted:966DescriptionAfter retirement as contestant from WHU ACM... 阅读全文
posted @ 2015-05-25 10:55 waterfull 阅读(142) 评论(0) 推荐(0) 编辑
(判断是否为弱联通分量) poj 2762
摘要：Going from u to v or from v to u?Time Limit:2000MSMemory Limit:65536KTotal Submissions:15294Accepted:4047DescriptionIn order to make their sons brave,... 阅读全文
posted @ 2015-05-25 10:15 waterfull 阅读(237) 评论(0) 推荐(0) 编辑
(最大生成树) poj 1979
摘要：Heavy TransportationTime Limit:3000MSMemory Limit:30000KTotal Submissions:22556Accepted:5987DescriptionBackgroundHugo Heavy is happy. After the breakd... 阅读全文
posted @ 2015-05-25 09:45 waterfull 阅读(126) 评论(0) 推荐(0) 编辑
(暴力) bzoj 2208
摘要：2208: [Jsoi2010]连通数Time Limit:20 SecMemory Limit:512 MBSubmit:1500Solved:612[Submit][Status][Discuss]DescriptionInput输入数据第一行是图顶点的数量，一个正整数N。 接下来N行，每行N个... 阅读全文
posted @ 2015-05-25 08:53 waterfull 阅读(158) 评论(0) 推荐(0) 编辑
(BFS) bzoj 1102
摘要：1102: [POI2007]山峰和山谷GrzTime Limit: 10 SecMemory Limit: 162 MBSubmit: 436Solved: 227[Submit][Status]DescriptionFGD小朋友特别喜欢爬山，在爬山的时候他就在研究山峰和山谷。为了能够让他对他的旅... 阅读全文
posted @ 2015-05-23 15:37 waterfull 阅读(221) 评论(0) 推荐(0) 编辑
(并查集) bzoj 1161
摘要：【bzoj1116】[POI2008]CLO2014年5月13日3470DescriptionByteotia城市有n个 towns m条双向roads. 每条 road 连接 两个不同的 towns ,没有重复的road. 你要把其中一些road变成单向边使得：每个town都有且只有一个入度Inp... 阅读全文
posted @ 2015-05-23 10:46 waterfull 阅读(406) 评论(0) 推荐(0) 编辑
(数学) bzoj 1800
摘要：1800: [Ahoi2009]fly 飞行棋Time Limit:10 SecMemory Limit:64 MBSubmit:973Solved:808[Submit][Status][Discuss]Description给出圆周上的若干个点，已知点与点之间的弧长，其值均为正整数，并依圆周顺序... 阅读全文
posted @ 2015-05-23 09:55 waterfull 阅读(156) 评论(0) 推荐(0) 编辑
(博弈) bzoj 2460
摘要：2463: [中山市选2009]谁能赢呢？Time Limit:10 SecMemory Limit:128 MBSubmit:969Solved:703[Submit][Status][Discuss]Description小明和小红经常玩一个博弈游戏。给定一个n×n的棋盘，一个石头被放在棋盘的左... 阅读全文
posted @ 2015-05-23 09:06 waterfull 阅读(141) 评论(0) 推荐(0) 编辑
(dinic) poj 3469
摘要：Dual Core CPUTime Limit:15000MSMemory Limit:131072KTotal Submissions:20366Accepted:8824Case Time Limit:5000MSDescriptionAs more and more computers are... 阅读全文
posted @ 2015-05-23 00:23 waterfull 阅读(151) 评论(0) 推荐(0) 编辑
（双端队列优化的SPFA） bzoj 2100
摘要：DescriptionBessie has two crisp red apples to deliver to two of her friends in the herd. Of course, she travels the C (1 6-> 7 -> 4* -> 3 -> 2 -> 1* ... 阅读全文
posted @ 2015-05-22 10:22 waterfull 阅读(382) 评论(0) 推荐(0) 编辑
(判断负环) bzoj 2019
摘要：Description奶 牛们没钱了，正在找工作。农夫约翰知道后，希望奶牛们四处转转，碰碰运气。而且他还加了一条要求：一头牛在一个城市最多只能赚D(1 #include#include#include#include#include#include#include#include#include#i... 阅读全文
posted @ 2015-05-22 09:43 waterfull 阅读(201) 评论(0) 推荐(0) 编辑
（最短路+二分） cogs 147
摘要：147. [USACO Jan08] 架设电话线★★☆ 输入文件：phoneline.in 输出文件：phoneline.out简单对比时间限制：1 s 内存限制：16 MBFarmer John打算将电话线引到自己的农场，但电信公司并不打算为他提供免费服务。于是，FJ必须为此向电信公司支付一定的费... 阅读全文
posted @ 2015-05-22 09:18 waterfull 阅读(123) 评论(0) 推荐(0) 编辑
poj 3255
摘要：RoadblocksTime Limit:2000MSMemory Limit:65536KTotal Submissions:8957Accepted:3221DescriptionBessie has moved to a small farm and sometimes enjoys retu... 阅读全文
posted @ 2015-05-22 08:29 waterfull 阅读(117) 评论(0) 推荐(0) 编辑
（DP） bzoj 2091
摘要：【bzoj2091】The Minima Game2014年10月20日2040Description给出N个正整数，AB两个人轮流取数，A先取。每次可以取任意多个数，直到N个数都被取走。每次获得的得分为取的数中的最小值，A和B的策略都是尽可能使得自己的得分减去对手的得分更大。在这样的情况下，最终A... 阅读全文
posted @ 2015-05-21 22:28 waterfull 阅读(132) 评论(0) 推荐(0) 编辑
(最短路) bzoj 2118
摘要：2118: 墨墨的等式Time Limit:10 SecMemory Limit:259 MBSubmit:479Solved:183[Submit][Status][Discuss]Description墨墨突然对等式很感兴趣，他正在研究a1x1+a2y2+…+anxn=B存在非负整数解的条件，他... 阅读全文
posted @ 2015-05-21 19:41 waterfull 阅读(440) 评论(0) 推荐(0) 编辑
(点双联通分量) poj 2942
摘要：Knights of the Round TableTime Limit:7000MSMemory Limit:65536KTotal Submissions:10512Accepted:3455DescriptionBeing a knight is a very attractive caree... 阅读全文
posted @ 2015-05-21 11:35 waterfull 阅读(97) 评论(0) 推荐(0) 编辑
(树直径) bzoj 1509
摘要：1509: [NOI2003]逃学的小孩Time Limit:5 SecMemory Limit:64 MBSubmit:447Solved:240[Submit][Status][Discuss]DescriptionInput第一行是两个整数N（3  N  200000）和M，分别表示居住点... 阅读全文
posted @ 2015-05-21 09:48 waterfull 阅读(219) 评论(0) 推荐(0) 编辑
(离线处理+BFS) poi Tales of seafaring
摘要：Tales of seafaringMemory limit: 128 MBYoung Bytensson loves to hang out in the port tavern, where he often listens to the sea dogs telling their tales... 阅读全文
posted @ 2015-05-21 09:10 waterfull 阅读(272) 评论(0) 推荐(0) 编辑
(并查集+DFS) poi guilds
摘要：GuildsMemory limit: 64 MBKing Byteasar faces a serious matter. Two competing trade organisations, The Tailors Guild and The Sewers Guild asked, at the... 阅读全文
posted @ 2015-05-21 08:48 waterfull 阅读(175) 评论(0) 推荐(0) 编辑
(记忆话搜索)POI Fibonacci Representation
摘要：Fibonacci RepresentationMemory limit: 64 MBThe Fibonacci sequence is a sequence of integers, called Fibonacci numbers, defined as follows:Its initial ... 阅读全文
posted @ 2015-05-20 16:38 waterfull 阅读(199) 评论(0) 推荐(0) 编辑
(DP) POI Bytecomputer
摘要：BytecomputerMemory limit: 128 MBA sequence ofintegersfrom the setis given. Thebytecomputeris a device that allows the following operation on the seque... 阅读全文
posted @ 2015-05-20 16:05 waterfull 阅读(177) 评论(0) 推荐(0) 编辑
(DP) bzoj 1296
摘要：1296: [SCOI2009]粉刷匠Time Limit:10 SecMemory Limit:162 MBSubmit:1042Solved:611[Submit][Status][Discuss]Descriptionwindy有 N 条木板需要被粉刷。 每条木板被分为 M 个格子。 每个格子... 阅读全文
posted @ 2015-05-20 15:36 waterfull 阅读(107) 评论(0) 推荐(0) 编辑
（DP） bzoj 3769
摘要：膜拜popoqqq大爷ORZZZZZZZZZZZZZZZZZZZZZZZZZZZ题目大意：求深度为h，大小为n个BST的数量对1000000007取模的值令f[i][j]为大小为i，深度为j以下的BST的数量设根节点为k，那么两个儿子一定分别是两个BST有递推式f[i][j]=(1<=k<=i)Σf... 阅读全文
posted @ 2015-05-20 11:05 waterfull 阅读(184) 评论(0) 推荐(0) 编辑
(数学) bzoj 1303
摘要：1303: [CQOI2009]中位数图Time Limit:1 SecMemory Limit:162 MBSubmit:1541Solved:1003[Submit][Status][Discuss]Description给出1~n的一个排列，统计该排列有多少个长度为奇数的连续子序列的中位数是b... 阅读全文
posted @ 2015-05-20 10:42 waterfull 阅读(132) 评论(0) 推荐(0) 编辑
(最小生成树) bzoj 3714
摘要：【bzoj3714】[PA2014]Kuglarz2014年9月28日3795Description魔术师的桌子上有n个杯子排成一行，编号为1,2,…,n，其中某些杯子底下藏有一个小球，如果你准确地猜出是哪些杯子，你就可以获得奖品。花费c_ij元，魔术师就会告诉你杯子i,i+1,…,j底下藏有球的总... 阅读全文
posted @ 2015-05-20 10:02 waterfull 阅读(294) 评论(0) 推荐(0) 编辑
(Dilworth定理) bzoj 3977
摘要：3997: [TJOI2015]组合数学Time Limit:20 SecMemory Limit:128 MBSubmit:326Solved:219[Submit][Status][Discuss]Description给出一个网格图，其中某些格子有财宝，每次从左上角出发，只能向下或右走。问至少... 阅读全文
posted @ 2015-05-20 09:37 waterfull 阅读(216) 评论(0) 推荐(0) 编辑
(二分图匹配) bzoj 1433
摘要：1433: [ZJOI2009]假期的宿舍Time Limit:10 SecMemory Limit:162 MBSubmit:1451Solved:628[Submit][Status][Discuss]DescriptionInputOutputSample Input131 1 00 1 00... 阅读全文
posted @ 2015-05-20 09:12 waterfull 阅读(154) 评论(0) 推荐(0) 编辑
(tarjan建图+topsort+状态压缩) bzoj 2208
摘要：2208: [Jsoi2010]连通数Time Limit:20 SecMemory Limit:512 MBSubmit:1489Solved:606[Submit][Status][Discuss]DescriptionInput输入数据第一行是图顶点的数量，一个正整数N。 接下来N行，每行N个... 阅读全文
posted @ 2015-05-20 08:37 waterfull 阅读(227) 评论(0) 推荐(0) 编辑
bzoj 1880
摘要：1880: [Sdoi2009]Elaxia的路线Time Limit:4 SecMemory Limit:64 MBSubmit:678Solved:251[Submit][Status][Discuss]Description最近，Elaxia和w**的关系特别好，他们很想整天在一起，但是大学的... 阅读全文
posted @ 2015-05-19 23:49 waterfull 阅读(281) 评论(0) 推荐(0) 编辑
(树形DP) bzoj 2657
摘要：2657: [Zjoi2012]旅游(journey)Time Limit:5 SecMemory Limit:128 MBSubmit:604Solved:387[Submit][Status][Discuss]Description到了难得的暑假，为了庆祝小白在数学考试中取得的优异成绩，小蓝决定... 阅读全文
posted @ 2015-05-19 23:44 waterfull 阅读(194) 评论(0) 推荐(0) 编辑
(DP) bzoj 1642
摘要：1642: [Usaco2007 Nov]Milking Time 挤奶时间Time Limit:5 SecMemory Limit:64 MBSubmit:590Solved:337[Submit][Status][Discuss]Description贝茜是一只非常努力工作的奶牛，她总是专注于提... 阅读全文
posted @ 2015-05-19 21:18 waterfull 阅读(103) 评论(0) 推荐(0) 编辑
(DP) bzoj 1978
摘要：1978: [BeiJing2010]取数游戏 gameTime Limit:10 SecMemory Limit:64 MBSubmit:729Solved:451[Submit][Status][Discuss]Description小 C 刚学了辗转相除法，正不亦乐乎，这小 P 又出来捣乱，给... 阅读全文
posted @ 2015-05-19 20:51 waterfull 阅读(130) 评论(0) 推荐(0) 编辑
（最小生成树的计数） bzoj 1060
摘要：1016: [JSOI2008]最小生成树计数Time Limit:1 SecMemory Limit:162 MBSubmit:3403Solved:1345[Submit][Status][Discuss]Description现在给出了一个简单无向加权图。你不满足于求出这个图的最小生成树，而希... 阅读全文
posted @ 2015-05-19 19:55 waterfull 阅读(232) 评论(0) 推荐(0) 编辑
(DP) bzoj 1079
摘要：1079: [SCOI2008]着色方案Time Limit:10 SecMemory Limit:162 MBSubmit:1068Solved:679[Submit][Status][Discuss]Description有n个木块排成一行，从左到右依次编号为1~n。你有k种颜色的油漆，其中第i... 阅读全文
posted @ 2015-05-19 19:04 waterfull 阅读(134) 评论(0) 推荐(0) 编辑
(二分) bzoj 1196
摘要：1196: [HNOI2006]公路修建问题Time Limit:10 SecMemory Limit:162 MBSubmit:1303Solved:717[Submit][Status][Discuss]DescriptionOI island是一个非常漂亮的岛屿,自开发以来,到这儿来旅游的人很... 阅读全文
posted @ 2015-05-19 15:48 waterfull 阅读(113) 评论(0) 推荐(0) 编辑
(树形DP) bzoj 1912
摘要：1912: [Apio2010]patrol 巡逻Time Limit:4 SecMemory Limit:64 MBSubmit:684Solved:387[Submit][Status][Discuss]DescriptionInput第一行包含两个整数 n, K(1 ≤ K ≤ 2)。接下来 ... 阅读全文
posted @ 2015-05-19 15:22 waterfull 阅读(165) 评论(0) 推荐(0) 编辑
bzoj 3505
摘要：3505: [Cqoi2014]数三角形Time Limit:10 SecMemory Limit:128 MBSubmit:698Solved:424[Submit][Status][Discuss]Description给定一个nxm的网格，请计算三点都在格点上的三角形共有多少个。下图为4x4的... 阅读全文
posted @ 2015-05-19 13:32 waterfull 阅读(102) 评论(0) 推荐(0) 编辑
(拓扑排序) bzoj 1040
摘要：4010: [HNOI2015]菜肴制作Time Limit:5 SecMemory Limit:512 MBSubmit:498Solved:275[Submit][Status][Discuss]Description知名美食家小 A被邀请至ATM 大酒店，为其品评菜肴。ATM 酒店为小 A 准... 阅读全文
posted @ 2015-05-19 11:58 waterfull 阅读(189) 评论(0) 推荐(0) 编辑
(DP ) bzoj 1996
摘要：1996: [Hnoi2010]chorus 合唱队Time Limit:4 SecMemory Limit:64 MBSubmit:1091Solved:702[Submit][Status][Discuss]DescriptionInputOutputSample Input41701 1702... 阅读全文
posted @ 2015-05-19 11:33 waterfull 阅读(132) 评论(0) 推荐(0) 编辑
(DP) bzoj 2298
摘要：2298: [HAOI2011]problem aTime Limit:10 SecMemory Limit:256 MBSubmit:714Solved:314[Submit][Status][Discuss]Description一次考试共有n个人参加，第i个人说：“有ai个人分数比我高，bi个... 阅读全文
posted @ 2015-05-19 10:26 waterfull 阅读(168) 评论(0) 推荐(0) 编辑
(floyd+DP) zoj 1232
摘要：Adventure of Super MarioTime Limit:2 Seconds Memory Limit:65536 KBAfter rescuing the beautiful princess, Super Mario needs to find a way home -- with ... 阅读全文
posted @ 2015-05-19 10:07 waterfull 阅读(187) 评论(0) 推荐(0) 编辑
(tajan+floyd) zoj 3232
摘要：It's not Floyd AlgorithmTime Limit:4 Seconds Memory Limit:32768 KBWhen a directed graph is given, we can solve its transitive closure easily using the... 阅读全文
posted @ 2015-05-18 12:07 waterfull 阅读(137) 评论(0) 推荐(0) 编辑
(floyd+DP) zoj 3027
摘要：Travelling FeeTime Limit:2 Seconds Memory Limit:65536 KBSamball is going to travel in the coming vacation. Now it's time to make a plan. After choosin... 阅读全文
posted @ 2015-05-18 11:25 waterfull 阅读(146) 评论(0) 推荐(0) 编辑
(树形DP) acdream 1028
摘要：PathTime Limit:4000/2000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others)SubmitStatisticNext ProblemProblem DescriptionCheck if there exists a... 阅读全文
posted @ 2015-05-18 10:35 waterfull 阅读(138) 评论(0) 推荐(0) 编辑
acdream 1032
摘要：ComponentTime Limit:10000/5000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others)SubmitStatisticNext ProblemProblem DescriptionGiven a tree with... 阅读全文
posted @ 2015-05-18 09:19 waterfull 阅读(166) 评论(0) 推荐(0) 编辑
(BFS) acdream 1191
摘要：Dragon MazeTime Limit:2000/1000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others)SubmitStatisticNext ProblemProblem DescriptionYou are the prin... 阅读全文
posted @ 2015-05-17 23:05 waterfull 阅读(118) 评论(0) 推荐(0) 编辑
(树形DP) bzoj 1060
摘要：1060: [ZJOI2007]时态同步Time Limit:10 SecMemory Limit:162 MBSubmit:1538Solved:391[Submit][Status][Discuss]Description小Q在电子工艺实习课上学习焊接电路板。一块电路板由若干个元件组成，我们不妨... 阅读全文
posted @ 2015-05-17 22:04 waterfull 阅读(190) 评论(0) 推荐(0) 编辑
(状态压缩DP) poj 2978
摘要：Colored stonesTime Limit:1000MSMemory Limit:65536KTotal Submissions:1734Accepted:819DescriptionYou are given a row ofmstones each of which has one ofk... 阅读全文
posted @ 2015-05-17 21:20 waterfull 阅读(210) 评论(0) 推荐(0) 编辑
(DP) codeforces 358D
摘要：D. Dima and Harestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDima liked the present he got f... 阅读全文
posted @ 2015-05-17 20:55 waterfull 阅读(213) 评论(0) 推荐(0) 编辑
(DP+二分) hdu 3433
摘要：A Task ProcessTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1273Accepted Submission(s): 631Probl... 阅读全文
posted @ 2015-05-17 18:57 waterfull 阅读(197) 评论(0) 推荐(0) 编辑
（最大生成树） hdu 3367
摘要：PseudoforestTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1957Accepted Submission(s): 756Proble... 阅读全文
posted @ 2015-05-17 17:07 waterfull 阅读(139) 评论(0) 推荐(0) 编辑
（最小生成树）hdu 3371
摘要：Connect the CitiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12557Accepted Submission(s): 345... 阅读全文
posted @ 2015-05-17 16:46 waterfull 阅读(123) 评论(0) 推荐(0) 编辑
(树形DP) city
摘要：CitiesAccepts: 30Submissions: 125Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)问题描述很久很久以前，有一个叫做杰哥的骑士. 他生活在一个小王国里. 这个王... 阅读全文
posted @ 2015-05-17 13:29 waterfull 阅读(367) 评论(0) 推荐(0) 编辑
(树形DP) zoj 3626
摘要：Treasure Hunt ITime Limit:2 Seconds Memory Limit:65536 KBAkiba is a dangerous country since a bloodsucker living there. Sometimes the bloodsucker will... 阅读全文
posted @ 2015-05-17 11:43 waterfull 阅读(162) 评论(0) 推荐(0) 编辑
(树形DP) zoj 3201
摘要：Tree of TreeTime Limit:1 Second Memory Limit:32768 KBYou're given a tree with weights of each node, you need to find the maximum subtree of specified ... 阅读全文
posted @ 2015-05-17 11:10 waterfull 阅读(107) 评论(0) 推荐(0) 编辑
bzoj 1045
摘要：1045: [HAOI2008] 糖果传递Time Limit:10 SecMemory Limit:162 MBSubmit:2628Solved:1134[Submit][Status][Discuss]Description有n个小朋友坐成一圈，每人有ai个糖果。每人只能给左右两人传递糖果。每... 阅读全文
posted @ 2015-05-17 10:21 waterfull 阅读(130) 评论(0) 推荐(0) 编辑
(树形DP) bzoj 4033
摘要：4033: [HAOI2015]T1Time Limit:10 SecMemory Limit:256 MBSubmit:120Solved:57[Submit][Status][Discuss]Description有一棵点数为 N 的树，树边有边权。给你一个在 0~ N 之内的正整数 K ，你要... 阅读全文
posted @ 2015-05-15 18:45 waterfull 阅读(358) 评论(0) 推荐(0) 编辑
(双指针) bzoj 1071
摘要：1071: [SCOI2007]组队Time Limit:1 SecMemory Limit:162 MBSubmit:1267Solved:392[Submit][Status][Discuss]DescriptionNBA每年都有球员选秀环节。通常用速度和身高两项数据来衡量一个篮球运动员的基本素... 阅读全文
posted @ 2015-05-15 16:29 waterfull 阅读(101) 评论(0) 推荐(0) 编辑
（搜索） poj 3700
摘要：Missile Defence SystemTime Limit:3000MSMemory Limit:65536KTotal Submissions:4284Accepted:1012DescriptionTo play against the threats of malicious count... 阅读全文
posted @ 2015-05-15 14:56 waterfull 阅读(263) 评论(0) 推荐(0) 编辑
(树分块) bzoj 1086
摘要：1086: [SCOI2005]王室联邦Time Limit:10 SecMemory Limit:162 MBSecSpecial JudgeSubmit:730Solved:403[Submit][Status][Discuss]Description“余”人国的国王想重新编制他的国家。他想把他... 阅读全文
posted @ 2015-05-15 14:03 waterfull 阅读(337) 评论(0) 推荐(0) 编辑
（floyd） hdu 4034
摘要：GraphTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 2030Accepted Submission(s): 1014Problem Descr... 阅读全文
posted @ 2015-05-15 10:52 waterfull 阅读(118) 评论(0) 推荐(0) 编辑
（基环树+DP） bzoj 1040
摘要：1040: [ZJOI2008]骑士Time Limit:10 SecMemory Limit:162 MBSubmit:2311Solved:884[Submit][Status][Discuss]DescriptionZ国的骑士团是一个很有势力的组织，帮会中汇聚了来自各地的精英。他们劫富济贫，惩... 阅读全文
posted @ 2015-05-15 10:19 waterfull 阅读(335) 评论(0) 推荐(0) 编辑
(树形DP) poj 3659
摘要：Cell Phone NetworkTime Limit:1000MSMemory Limit:65536KTotal Submissions:5916Accepted:2119DescriptionFarmer John has decided to give each of his cows a... 阅读全文
posted @ 2015-05-14 16:03 waterfull 阅读(106) 评论(0) 推荐(0) 编辑
(树形DP) poj 3398
摘要：Perfect ServiceTime Limit:2000MSMemory Limit:65536KTotal Submissions:1393Accepted:679DescriptionA network is composed ofNcomputers connected byN− 1 co... 阅读全文
posted @ 2015-05-14 11:44 waterfull 阅读(208) 评论(0) 推荐(1) 编辑
(贪心+倍增求LCA) hdu 4912
摘要：Paths on the treeTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1097Accepted Submission(s): 366... 阅读全文
posted @ 2015-05-14 10:25 waterfull 阅读(209) 评论(0) 推荐(0) 编辑
(离线算法 LCA) hdu 2874
摘要：Connections between citiesTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5893Accepted Submission... 阅读全文
posted @ 2015-05-14 09:09 waterfull 阅读(156) 评论(0) 推荐(0) 编辑
(树形DP) hdu 4118
摘要：Holiday's AccommodationTime Limit: 8000/4000 MS (Java/Others)Memory Limit: 200000/200000 K (Java/Others)Total Submission(s): 2665Accepted Submission(s... 阅读全文
posted @ 2015-05-13 22:29 waterfull 阅读(123) 评论(0) 推荐(0) 编辑
(树的重心) poj 1655
摘要：Balancing ActTime Limit:1000MSMemory Limit:65536KTotal Submissions:9965Accepted:4087DescriptionConsider a tree T with N (1 #include#include#include#in... 阅读全文
posted @ 2015-05-13 21:04 waterfull 阅读(121) 评论(0) 推荐(0) 编辑
(线性基) bzoj 2115
摘要：2115: [Wc2011] XorTime Limit:10 SecMemory Limit:259 MBSubmit:1258Solved:550[Submit][Status][Discuss]DescriptionInput第一行包含两个整数N和 M， 表示该无向图中点的数目与边的数目。 接... 阅读全文
posted @ 2015-05-13 20:31 waterfull 阅读(130) 评论(0) 推荐(0) 编辑
(线性基) bzoj 2460
摘要：2460: [BeiJing2011]元素Time Limit:20 SecMemory Limit:128 MBSubmit:333Solved:176[Submit][Status][Discuss]Description 相传，在远古时期，位于西方大陆的 Magic Land 上，人们已经掌握... 阅读全文
posted @ 2015-05-13 19:13 waterfull 阅读(203) 评论(0) 推荐(0) 编辑
(边双联通+树直径) hdu 4612
摘要：Warm upTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 4437Accepted Submission(s): 1001Problem De... 阅读全文
posted @ 2015-05-13 16:53 waterfull 阅读(154) 评论(0) 推荐(0) 编辑
(拓扑图+DP) poj 3249
摘要：Test for JobTime Limit:5000MSMemory Limit:65536KTotal Submissions:9563Accepted:2201DescriptionMr.Dog was fired by his company. In order to support his... 阅读全文
posted @ 2015-05-13 15:59 waterfull 阅读(175) 评论(0) 推荐(0) 编辑
（求割点和除去割点后的联通块数目） poj 1523
摘要：SPFTime Limit:1000MSMemory Limit:10000KTotal Submissions:6766Accepted:3086DescriptionConsider the two networks shown below. Assuming that data moves a... 阅读全文
posted @ 2015-05-13 14:15 waterfull 阅读(163) 评论(0) 推荐(0) 编辑
(边双联通) poj 3352
摘要：Road ConstructionTime Limit:2000MSMemory Limit:65536KTotal Submissions:9549Accepted:4741DescriptionIt's almost summer time, and that means that it's a... 阅读全文
posted @ 2015-05-13 12:40 waterfull 阅读(115) 评论(0) 推荐(0) 编辑
(DP求最长路) hdu 4607
摘要：Park VisitTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2624Accepted Submission(s): 1178Problem ... 阅读全文
posted @ 2015-05-11 11:01 waterfull 阅读(172) 评论(0) 推荐(0) 编辑
(树形DP) hdu 2196
摘要：ComputerTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3982Accepted Submission(s): 1996Problem De... 阅读全文
posted @ 2015-05-11 10:29 waterfull 阅读(125) 评论(0) 推荐(0) 编辑
（并查集+树形DP） hdu 4514
摘要：湫湫系列故事——设计风景线Time Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3269Accepted Submission(s): 587Proble... 阅读全文
posted @ 2015-05-11 09:55 waterfull 阅读(472) 评论(0) 推荐(0) 编辑
(状态压缩DP) poj 2441
摘要：Arrange the BullsTime Limit:4000MSMemory Limit:65536KTotal Submissions:3709Accepted:1422DescriptionFarmer Johnson's Bulls love playing basketball very... 阅读全文
posted @ 2015-05-08 20:00 waterfull 阅读(136) 评论(0) 推荐(0) 编辑
(DP) hdu 4517
摘要：小小明系列故事——游戏的烦恼Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 878Accepted Submission(s): 308Proble... 阅读全文
posted @ 2015-05-08 19:18 waterfull 阅读(122) 评论(0) 推荐(0) 编辑
hdu 3811
摘要：PermutationTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 372Accepted Submission(s): 161Problem D... 阅读全文
posted @ 2015-05-08 18:10 waterfull 阅读(186) 评论(0) 推荐(0) 编辑
（spfa+分层图） bzoj 2763
摘要：2763: [JLOI2011]飞行路线Time Limit:10 SecMemory Limit:128 MBSubmit:1046Solved:410[Submit][Status][Discuss]DescriptionAlice和Bob现在要乘飞机旅行，他们选择了一家相对便宜的航空公司。该航... 阅读全文
posted @ 2015-05-08 15:56 waterfull 阅读(425) 评论(0) 推荐(0) 编辑
(贪心+并查集) poj 3228
摘要：Gold TransportationTime Limit:2000MSMemory Limit:65536KTotal Submissions:3060Accepted:1089DescriptionRecently, a number of gold mines have been discov... 阅读全文
posted @ 2015-05-08 11:34 waterfull 阅读(106) 评论(0) 推荐(0) 编辑
(SPFA处理有后效性的动态规划问题) bzoj 3875
摘要：3875: [Ahoi2014]骑士游戏Time Limit:30 SecMemory Limit:256 MBSubmit:181Solved:91[Submit][Status][Discuss]Description【故事背景】长期的宅男生活中，JYY又挖掘出了一款RPG游戏。在这个游戏中JY... 阅读全文
posted @ 2015-05-08 09:44 waterfull 阅读(760) 评论(0) 推荐(0) 编辑
(floyd求最小环) hdu 1599
摘要：find the mincost routeTime Limit: 1000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2997Accepted Submission(s): ... 阅读全文
posted @ 2015-05-08 09:03 waterfull 阅读(205) 评论(0) 推荐(0) 编辑
(floyd 倍增) poj 3613
摘要：Cow RelaysTime Limit:1000MSMemory Limit:65536KTotal Submissions:5720Accepted:2266DescriptionFor their physical fitness program,N(2 ≤N≤ 1,000,000) cows... 阅读全文
posted @ 2015-05-08 08:49 waterfull 阅读(215) 评论(0) 推荐(0) 编辑
（自用）字典树模板
摘要：void insert(){ scanf("%s",src); int i,x=0,alp; for(i=0;src[i];i++) { alp=src[i]-'0'; if(!son[x][alp]... 阅读全文
posted @ 2015-05-07 20:48 waterfull 阅读(111) 评论(0) 推荐(0) 编辑
(STL大法) hdu 3283
摘要：The Next PermutationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 850Accepted Submission(s): 597... 阅读全文
posted @ 2015-05-07 20:32 waterfull 阅读(188) 评论(0) 推荐(0) 编辑
（最小树形图 朱刘算法） poj 3164
摘要：Command NetworkTime Limit:1000MSMemory Limit:131072KTotal Submissions:14340Accepted:4118DescriptionAfter a long lasting war on words, a war on arms fi... 阅读全文
posted @ 2015-05-07 20:08 waterfull 阅读(151) 评论(0) 推荐(0) 编辑
（manacher算法） poj 3974
摘要：PalindromeTime Limit:15000MSMemory Limit:65536KTotal Submissions:5193Accepted:1867DescriptionAndy the smart computer science student was attending an ... 阅读全文
posted @ 2015-05-07 15:17 waterfull 阅读(149) 评论(0) 推荐(0) 编辑
(MST+二分) bzoj 2654
摘要：2654: treeTime Limit:30 SecMemory Limit:512 MBSubmit:515Solved:195[Submit][Status][Discuss]Description 给你一个无向带权连通图，每条边是黑色或白色。让你求一棵最小权的恰好有need条白色边的生成树... 阅读全文
posted @ 2015-05-04 14:58 waterfull 阅读(153) 评论(0) 推荐(0) 编辑
(带权并查集) bzoj 1202
摘要：1202: [HNOI2005]狡猾的商人Time Limit:10 SecMemory Limit:162 MBSubmit:1745Solved:837[Submit][Status][Discuss]Description刁姹接到一个任务，为税务部门调查一位商人的账本，看看账本是不是伪造的。账... 阅读全文
posted @ 2015-05-04 10:45 waterfull 阅读(246) 评论(0) 推荐(0) 编辑
(贪心+最小生成树) bzoj 1821
摘要：1821: [JSOI2010]Group 部落划分 GroupTime Limit:10 SecMemory Limit:64 MBSubmit:1409Solved:678[Submit][Status][Discuss]Description聪聪研究发现，荒岛野人总是过着群居的生活，但是，并不... 阅读全文
posted @ 2015-05-04 10:04 waterfull 阅读(164) 评论(0) 推荐(0) 编辑
(次短路) poj 3255
摘要：RoadblocksTime Limit:2000MSMemory Limit:65536KTotal Submissions:8706Accepted:3145DescriptionBessie has moved to a small farm and sometimes enjoys retu... 阅读全文
posted @ 2015-05-04 09:06 waterfull 阅读(131) 评论(0) 推荐(0) 编辑
(floyd) poj 1125
摘要：Stockbroker GrapevineTime Limit:1000MSMemory Limit:10000KTotal Submissions:28670Accepted:15895DescriptionStockbrokers are known to overreact to rumour... 阅读全文
posted @ 2015-05-03 18:21 waterfull 阅读(124) 评论(0) 推荐(0) 编辑
(floyd+补集) poj 3275
摘要：Ranking the CowsTime Limit:2000MSMemory Limit:65536KTotal Submissions:2569Accepted:1203DescriptionEach of Farmer John'sNcows (1 ≤N≤ 1,000) produces mi... 阅读全文
posted @ 2015-05-03 18:06 waterfull 阅读(137) 评论(0) 推荐(0) 编辑
(模拟) poj 1068
摘要：ParencodingsTime Limit:1000MSMemory Limit:10000KTotal Submissions:20999Accepted:12585DescriptionLet S = s1 s2...s2n be a well-formed string of parenth... 阅读全文
posted @ 2015-05-03 17:28 waterfull 阅读(154) 评论(0) 推荐(0) 编辑
(DP) poj 3298
摘要：AntimonotonicityTime Limit:2000MSMemory Limit:65536KTotal Submissions:2913Accepted:1266DescriptionI have a sequenceFredof lengthncomprised of integers... 阅读全文
posted @ 2015-05-03 16:05 waterfull 阅读(141) 评论(0) 推荐(0) 编辑
(hash) hdu 1496
摘要：EquationsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6089Accepted Submission(s): 2465Problem D... 阅读全文
posted @ 2015-05-03 11:39 waterfull 阅读(103) 评论(0) 推荐(0) 编辑
（拆点+最小路径覆盖） bzoj 2150
摘要：2150: 部落战争Time Limit:10 SecMemory Limit:259 MBSubmit:518Solved:298[Submit][Status][Discuss]Descriptionlanzerb的部落在A国的上部，他们不满天寒地冻的环境，于是准备向A国的下部征战来获得更大的领... 阅读全文
posted @ 2015-05-01 11:11 waterfull 阅读(264) 评论(0) 推荐(0) 编辑
（最长链） bzoj 1143
摘要：1143: [CTSC2008]祭祀riverTime Limit:10 SecMemory Limit:162 MBSubmit:1285Solved:645[Submit][Status][Discuss]Description在遥远的东方，有一个神秘的民族，自称Y族。他们世代居住在水面上，奉龙... 阅读全文
posted @ 2015-05-01 10:09 waterfull 阅读(636) 评论(0) 推荐(0) 编辑