ACM
文章平均质量分 86
StanleyClinton
一个川大的弱弱的ACMER,加油整起走。
展开
-
解题报告 之 UVA1610 Party Games
解题报告 之 UVA1610 Party GamesDescriptionYou've been invited to a party. The host wants to divide the guests into 2 teams for party games, withexactly the same number of guests on原创 2015-03-08 23:40:38 · 690 阅读 · 0 评论 -
解题报告 之 UVA437 The Tower of Babylon
解题报告 之 UVA437 The Tower of BabylonDescriptionPerhaps you have heard of the legend of the Tower of Babylon. Nowadays many details of this tale have been forgotten. So now, in line with原创 2015-03-20 17:21:31 · 470 阅读 · 0 评论 -
解题报告 之 UVA120 Stacks of Flapjacks
解题报告 之 UVA120 Stacks of FlapjacksDescriptionBackgroundStacks and Queues are often considered the bread and butter of data structures and find use in architecture, parsing, operatin原创 2015-03-09 17:04:18 · 601 阅读 · 0 评论 -
解题报告 之 UVA1152 4 Values Whose Sum is Zero
解题报告 之 UVA1152 4 Values Whose Sum is ZeroDescriptionThe SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d原创 2015-03-12 14:41:06 · 601 阅读 · 0 评论 -
解题报告 之 UVA11134 Fabled Rooks
解题报告 之 UVA11134 Fabled RooksDescriptionProblem F: Fabled RooksWe would like to place n rooks, 1 ≤ n ≤ 5000, on a n×nboard subject to the following restrictionsThe i-th rook can on原创 2015-03-13 13:18:18 · 467 阅读 · 0 评论 -
解题报告 之 UVA1605 Building for UN
解题报告 之 UVA120 Stacks of FlapjacksDescriptionThe United Nations has decided to build a new headquarters in Saint Petersburg, Russia. It will have a form of a rectangular parallelepiped an原创 2015-03-12 14:38:25 · 577 阅读 · 0 评论 -
解题报告 之 UVA11054 Wine trading in Gergovia
解题报告 之 UVA11054 Wine trading in GergoviaDescriptionAs you may know from the comic "Asterix and the Chieftain's Shield", Gergovia consists of one street, and every inhabitant of the c原创 2015-03-13 14:36:19 · 519 阅读 · 0 评论 -
解题报告 之 UVA11572 Unique Snowflakes
解题报告 之 UVA11572 Unique SnowflakesDescriptionEmily the entrepreneur has a cool business idea: packaging and selling snowflakes. She has devised amachine that captures snowflakes原创 2015-03-14 15:30:10 · 1019 阅读 · 0 评论 -
解题报告 之 UVA714 Copying Books
解题报告 之 UVA714 Copying BooksDescriptionBefore the invention of book-printing, it was very hard to make a copy of a book. All the contents had to be re-written by hand by so called scr原创 2015-03-14 17:47:31 · 695 阅读 · 0 评论 -
解题报告 之 POJ2782 Bin Packing
解题报告 之 POJ Bin PackingDescriptionA set of n 1-dimensional items have to be packed in identical bins. All bins have exactly the same length l and each item i has length lieach bin con原创 2015-03-08 00:02:44 · 1359 阅读 · 0 评论 -
解题报告 之 UVA11093 Just Finish it up
解题报告 之 UVA11093 Just Finish it upDescription I I U P C 2 0 06Problem J: Just Finish it upInput: standard inputOutput: standard output Al原创 2015-03-18 17:32:30 · 1404 阅读 · 0 评论 -
解题报告 之 UVA1025 A Spy in the Metro
解题报告 之 UVA1025 A Spy in the MetroDescriptionSecret agent Maria was sent to Algorithms City to carry out an especially dangerous mission. After several thrilling events we find her原创 2015-03-18 17:39:35 · 633 阅读 · 0 评论 -
解题报告 之 HDU5115 Dire Wolf
解题报告 之 hdu5115 Dire WolfDescriptionDire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves appear to originate from Draenor.原创 2015-03-19 00:13:37 · 755 阅读 · 0 评论 -
解题报告 之 POJ3041 Asteroids
解题报告 之 POJ3041 Asteroids 最大流 最小点覆盖 二分图匹配Bessie 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 conveniently located at the latti原创 2015-04-28 10:16:26 · 589 阅读 · 0 评论 -
解题报告 之 POJ2135 Farm Tour
POJ2135 Farm Tour 最大流 最小费用流When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of which contains the big barn. A total M (1 <原创 2015-04-29 09:43:16 · 736 阅读 · 0 评论 -
解题报告 之 SOJ2414 Leapin' Lizards
解题报告 之 SOJ2414 Leapin' LizardsYour platoon of wandering lizards has entered a strange room in the labyrinth you are exploring. As you are looking around for hidden treasures, one of the rookies steps on an innocent-looking stone and the room's floor sudd原创 2015-04-26 10:00:24 · 757 阅读 · 0 评论 -
解题报告 之 POJ1087 A Plug for UNIX
解题报告 之 POJ1087 A Plug for UNIX 最大流+拆点原理详解原创 2015-04-18 23:30:54 · 767 阅读 · 0 评论 -
解题报告 之 SOJ4426 Counting_3
解题报告 之 SOJ 4426 Counting_3DescriptionDefine f(0)=1 and f(n) to be the number of different ways n can be expressed as a sum of integer powers of 3 using each power no more than 3 times.For exam原创 2015-04-14 16:51:24 · 435 阅读 · 0 评论 -
解题报告 之 POJ1273 Drainage Ditches
解题报告 之 POJ1273 Drainage DitchesDescriptionEvery 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原创 2015-04-13 23:17:44 · 374 阅读 · 0 评论 -
解题报告 之 UVA1347 Tour
解题报告 之 UVA1347 TourDescriptionJohn Doe, a skilled pilot, enjoys traveling. While on vacation, he rents a small plane and starts visiting beautiful places. To save money, John must dete原创 2015-03-23 11:40:27 · 722 阅读 · 0 评论 -
解题报告 之 SGU242 Student's Morning
解题报告 之 SGU 242 Student's Morning 最大流 二分匹配 残余网络 输出一组解原创 2015-04-23 13:16:47 · 666 阅读 · 0 评论 -
解题报告 之 HDU2544 最短路
解题报告 之 HDU2544 最短路 Floyd Dijkstra SPFA Bellman原创 2015-04-27 13:19:19 · 567 阅读 · 0 评论 -
解题报告 之 POJ3680 Intervals
解题报告 之 POJ 3680 Intervals 最小费用流 标号法 ACM 负权边You are given N weighted open intervals. The ith interval covers (ai, bi) and weighs wi. Your task is to pick some of the intervals to maximize the total weights under the limit that no point in the real axis is原创 2015-05-02 10:18:31 · 2454 阅读 · 1 评论 -
解题报告 之 SGU185 Two shortest
解题报告 之 SGU 185 Two shortest 最大流 边不重复最短路Yesterday Vasya and Petya quarreled badly, and now they don't want to see each other on their way to school. The problem is that they live in one and the same house, leave the house at the same time and go at the sa原创 2015-04-27 19:35:16 · 642 阅读 · 0 评论 -
最短路SPFA 算法详解
最短路 SPFA 算法 详解原创 2015-04-27 14:04:34 · 2710 阅读 · 3 评论 -
解题报告 之 SOJ3312 Stockholm Knights
解题报告 之 SOJ 3312 Stockholm Knights 最大流 网格 动态流 二分 The city of Stockholm is a chessboard whose size is N*M. There are some Stockholm Knights in the city.Stockholm Knights are very special Knights.They only can move from a corner of a 3*4 grid to the oppo原创 2015-04-27 01:06:52 · 683 阅读 · 0 评论 -
解题报告 之 SOJ2835 Pick Up Points
解题报告 之 SOJ 2835 Pick Up Points CFW牛吃草喝水模型 最大流Description Recently loy are very interested in playing a funny game. There is a board of n*m grid. Each grid has one point or not. If two adjacency grids both have one point, someone can pick them up, and原创 2015-04-26 11:45:15 · 760 阅读 · 0 评论 -
解题报告 之 POJ2699 The Maximum Number of Strong Kings
解题报告 之 POJ 2699 The Maximum Number of Strong Kings 最大流 二分 枚举 建图原创 2015-04-25 13:11:41 · 1138 阅读 · 0 评论 -
解题报告 之 POJ3281 Dining
解题报告 之 POJ 3281 Dining 最大流 经典构图 牛吃草问题 食物 饮料 最大分配原创 2015-04-22 09:28:50 · 2192 阅读 · 0 评论 -
解题报告 之 UVA820 Internet Bandwidth
解题报告 之 UVA820 Internet Bandwidth 最大流 原始模型原创 2015-04-22 09:01:09 · 1558 阅读 · 0 评论 -
解题报告 之 UVA563 Crimewave
解题报告 之 UVA563 Crimewave 最大流 拆点原创 2015-04-21 19:20:43 · 635 阅读 · 0 评论 -
解题报告 之 SGU326 Perspective
解题报告 之 SGU 326 Perspective 最大流 满流DescriptionBreaking news! A Russian billionaire has bought a yet undisclosed NBA team. He's planning to invest huge effort and money into making that team原创 2015-04-21 10:57:44 · 776 阅读 · 0 评论 -
解题报告 之 WHU1124 Football Coach
解题报告 之 WHU1124 Football Coach 最大流 满流原创 2015-04-21 09:58:23 · 902 阅读 · 0 评论 -
解题报告 之 POJ2391 Ombrophobic Bovines
解题报告 之 POJ 2391 Ombrophobic Bovines 最大流 拆点原创 2015-04-20 19:55:26 · 525 阅读 · 0 评论 -
解题报告 之 POJ3498 March of the Penguins
解题报告 之 POJ 3498 March of the Penguins 最大流原创 2015-04-17 23:15:14 · 1283 阅读 · 0 评论 -
解题报告 之 POJ3189 Steady Cow Assignment
解题报告 之 POJ3189 Steady Cow AssignmentDescriptionFarmer John's N (1 FJ would like to rearrange the cows such that the cows are as equally happy as possible, even if that means all原创 2015-04-16 13:02:55 · 509 阅读 · 0 评论 -
解题报告 之 POJ2112 Optimal Milking
解题报告 之 POJ2112 Optimal MilkingDescriptionFJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various leng原创 2015-04-15 15:55:33 · 545 阅读 · 0 评论 -
解题报告 之 POJ1459 Power Network
解题报告 之 POJ1459 Power NetworkDescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with原创 2015-04-15 14:59:44 · 475 阅读 · 0 评论 -
解题报告 之 HDU1698 Alice's Chance
解题报告 之 HDU1698 Alice's ChanceDescriptionAlice, a charming girl, have been dreaming of being a movie star for long. Her chances will come now, for several filmmaking companies invite he原创 2015-04-14 19:31:41 · 450 阅读 · 0 评论 -
解题报告 之 SOJ4429 Frog's Dice
解题报告 之 SOJ 4429 Frog's DiceThe Problemfrog has many dices:)Each dice has six surfaces and there is a lowercase letter on each surfaces.Now, frog want to put these dices in a row so tha原创 2015-04-14 00:13:23 · 631 阅读 · 0 评论