08 2015 档案

HDU 1081 To The Max
摘要：Problem Description：Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or grea... 阅读全文
posted @ 2015-08-21 09:41 搁浅の记忆 阅读(153) 评论(0) 推荐(0)
LightOJ 1138
摘要：Description:You task is to find minimal natural numberN, so thatN!contains exactlyQzeroes on the trail in decimal notation. As you knowN! = 1*2*...*N.... 阅读全文
posted @ 2015-08-20 20:30 搁浅の记忆 阅读(318) 评论(0) 推荐(1)
ZOJ 1610 Count the Colors
摘要：Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting the segmen... 阅读全文
posted @ 2015-08-19 21:26 搁浅の记忆 阅读(139) 评论(0) 推荐(0)
POJ 3177 Redundant Paths（无向图缩点）
摘要：Description：In order to get from one of the F (1 2 and 1 –> 6 –> 5 –> 21 – 4: 1 –> 2 –> 3 –> 4 and 1 –> 6 –> 5 –> 43 – 7: 3 –> 4 –> 7 and 3 –> 2 –> 5... 阅读全文
posted @ 2015-08-19 10:23 搁浅の记忆 阅读(168) 评论(0) 推荐(0)
POJ 1502 MPI Maelstrom
摘要：Description：BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarc... 阅读全文
posted @ 2015-08-18 16:48 搁浅の记忆 阅读(133) 评论(0) 推荐(0)
LightOJ 1094
摘要：Description：Given a tree (a connected graph with no cycles), you have to find the farthest nodes in the tree. The edges of the tree are weighted and u... 阅读全文
posted @ 2015-08-18 14:46 搁浅の记忆 阅读(143) 评论(0) 推荐(0)
POJ 1564 Sum It Up（深搜）
摘要：Description:Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t... 阅读全文
posted @ 2015-08-18 09:44 搁浅の记忆 阅读(227) 评论(0) 推荐(0)
POJ 1238 Substrings
摘要：Problem Description:You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its i... 阅读全文
posted @ 2015-08-18 08:41 搁浅の记忆 阅读(194) 评论(0) 推荐(0)
ZOJ Team Formation
摘要：Description：For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team fromNstudents of his universit... 阅读全文
posted @ 2015-08-17 19:54 搁浅の记忆 阅读(238) 评论(0) 推荐(0)
POJ 1459 Power Network
摘要：Description:A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied... 阅读全文
posted @ 2015-08-17 10:20 搁浅の记忆 阅读(156) 评论(0) 推荐(0)
POJ 1458 Common Subsequence
摘要：Description:A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequenc... 阅读全文
posted @ 2015-08-15 17:14 搁浅の记忆 阅读(113) 评论(0) 推荐(0)
HDU 1394 Minimum Inversion Number
摘要：Description：The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj.For a given sequence of... 阅读全文
posted @ 2015-08-15 15:55 搁浅の记忆 阅读(141) 评论(0) 推荐(0)
POJ 3436 ACM Computer Factory
摘要：Description：As you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. That is why all these ... 阅读全文
posted @ 2015-08-15 14:18 搁浅の记忆 阅读(179) 评论(0) 推荐(0)
UVa 10480 Sabotage
摘要：10480 Sabotage:The regime of a small but wealthy dictatorship has been abruptly overthrown by an unexpected rebellion.Because of the enormous disturba... 阅读全文
posted @ 2015-08-15 08:58 搁浅の记忆 阅读(296) 评论(0) 推荐(0)
HDU 1069 Monkey and Banana
摘要：Problem Description：A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, ... 阅读全文
posted @ 2015-08-14 21:35 搁浅の记忆 阅读(171) 评论(0) 推荐(0)
POJ 3026 Borg Maze
摘要：Description：The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used t... 阅读全文
posted @ 2015-08-13 19:17 搁浅の记忆 阅读(143) 评论(0) 推荐(0)
POJ 3020 Antenna Placement(二分匹配最小路径覆盖)
摘要：Description：The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most str... 阅读全文
posted @ 2015-08-13 14:29 搁浅の记忆 阅读(204) 评论(0) 推荐(0)
HDU 2819 Swap（记录二分匹配的过程）
摘要：Problem Description：Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all ... 阅读全文
posted @ 2015-08-12 20:24 搁浅の记忆 阅读(180) 评论(0) 推荐(0)
POJ 1273 Drainage Ditches（网络流模板）
摘要：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 wa... 阅读全文
posted @ 2015-08-12 15:24 搁浅の记忆 阅读(153) 评论(0) 推荐(0)
HDU 2444 The Accomodation of Students（BFS判断是否为二分图）
摘要：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 ea... 阅读全文
posted @ 2015-08-11 16:00 搁浅の记忆 阅读(409) 评论(0) 推荐(0)
HDU 1498 50 years, 50 colors
摘要：Problem Description：On Octorber 21st, HDU 50-year-celebration, 50-color balloons floating around the campus, it's so nice, isn't it? To celebrate this... 阅读全文
posted @ 2015-08-11 10:22 搁浅の记忆 阅读(167) 评论(0) 推荐(0)
POJ 1466 Girls and Boys(最大独立集)
摘要：Description：In the second year of the university somebody started a study on the romantic relations between the students. The relation "romantically i... 阅读全文
posted @ 2015-08-10 20:00 搁浅の记忆 阅读(180) 评论(0) 推荐(0)
HDU 1045 Fire Net（缩点求最大匹配）
摘要：Problem Description：Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each repres... 阅读全文
posted @ 2015-08-10 17:56 搁浅の记忆 阅读(148) 评论(0) 推荐(0)
POJ 2195 Going Home(BFS+KM求最小权值)
摘要：Description：On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or ver... 阅读全文
posted @ 2015-08-10 15:56 搁浅の记忆 阅读(321) 评论(0) 推荐(0)
HDU 2255 奔小康赚大钱(KM算法求完备匹配)
摘要：Problem Description：传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到... 阅读全文
posted @ 2015-08-08 20:56 搁浅の记忆 阅读(195) 评论(0) 推荐(0)
POJ 3694 Network（无向图求桥的个数，有重边）
摘要：Description：A network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of c... 阅读全文
posted @ 2015-08-07 10:20 搁浅の记忆 阅读(286) 评论(0) 推荐(0)
POJ 1236 Network of Schools(强连通分量缩点求根节点和叶子节点的个数)
摘要：Description：A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list ... 阅读全文
posted @ 2015-08-06 17:33 搁浅の记忆 阅读(196) 评论(0) 推荐(0)
UVA 796 Critical Links(无向图求桥)
摘要：题目来源：UVa Online Judgehttps://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=737求一个连通图中必不可少的路径：#include#includ... 阅读全文
posted @ 2015-08-06 09:12 搁浅の记忆 阅读(159) 评论(0) 推荐(0)
UVA 315 Network（无向图求割点）
摘要：Description:A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from... 阅读全文
posted @ 2015-08-05 16:21 搁浅の记忆 阅读(157) 评论(0) 推荐(0)
HDU 1269 迷宫城堡（求是否只有一个强连通分量）
摘要：Problem Description：为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N#include#include#include#define N 10010using namespace std;int dfn[N], low[N]; //dfn数组表示遍历至该点的时... 阅读全文
posted @ 2015-08-05 14:56 搁浅の记忆 阅读(173) 评论(0) 推荐(0)
HDU 3974 Assign the task
摘要：Problem - 3974http://acm.hdu.edu.cn/showproblem.php?pid=3974Description：There is a company that has N employees(numbered from 1 to N),every employee i... 阅读全文
posted @ 2015-08-04 08:53 搁浅の记忆 阅读(192) 评论(0) 推荐(0)
HDU 1540 Tunnel Warfare
摘要：Problem Description：During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Gen... 阅读全文
posted @ 2015-08-03 15:39 搁浅の记忆 阅读(164) 评论(0) 推荐(0)
POJ 2528 Mayor's posters
摘要：DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral poster... 阅读全文
posted @ 2015-08-01 15:01 搁浅の记忆 阅读(192) 评论(0) 推荐(0)