2014年07月_SF-_-

10月 09月 08月 07月 06月 05月 04月 03月 02月

原创 UVa 269 Counting Patterns 解题报告（暴力）

#include #include #include #include #include #include #include #include #include #include #include using namespace std;#define ff(i, n) for(int i=0;i<(n);i++)#define fff(i, n, m) for(int

2014-07-31 11:34:52 739

原创 UVa 225 - Golygons 解题报告（暴力）

Golygons Imagine a country whose cities have all their streets laid out in a regular grid. Now suppose that a tourist with an obsession for geometry is planning expeditions to several such

2014-07-30 18:20:03 1126

原创 UVa 165 - Stamps 解题报告（暴力）

Stamps The government of Nova Mareterrania requires that various legal documents have stamps attached to them so that the government can derive revenue from them. In terms of recent legisl

2014-07-30 10:26:42 757

原创 HDU 4891 The Great Pan 解题报告（水题）

解题报告：扫描一次#include #include #include #include #include #include #include #include #include #include #include using namespace std;#define ff(i, n) for(int i=0;i<(n);i++)#define fff(i, n,

2014-07-29 22:11:06 868

原创 HDU 4893 Wow! Such Sequence! 解题报告（线段树）

Wow! Such Sequence!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 850 Accepted Submission(s): 251Problem DescriptionRecentl

2014-07-29 22:07:04 719

原创 UVa 140 - BandWidth 解题报告（暴力）

Bandwidth Given a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an ordering on the elements in V, then thebandwidth of a node v is defined as the maximum dista

2014-07-29 11:08:57 655

原创 UVa 812 - Trade on Verweggistan 解题报告（枚举）

解题报告：题意有些#include #include #include #include #include #include #include #include #include #include #include using namespace std;#define ff(i, n) for(int i=0;i<(n);i++)#define fff(i, n,

2014-07-29 10:35:18 931

原创 UVa 769 - Magic of David Copperfield 解题报告（思维）

Magic of David Copperfield The well-known magician David Copperfield loves to show the following trick: a square withN rows andN columns of different pictures appears on a TV screen. L

2014-07-28 23:35:40 807

原创 UVa 669 - Defragment 解题报告（暴力）

Defragment You are taking part in the development of a ``New Generation'' operating system and the NG file system. In this file system all disk space is divided into N clusters of the equa

2014-07-28 19:08:56 925

原创 UVa 434 - Matty's Blocks 解题报告（水题）

434 - Matty's BlocksTime limit: 3.000 seconds Matty's Blocks Little Matty liked playing with his blocks very much. He always constructed his `buildings' in the same way:

2014-07-28 16:32:41 662

原创 Uva 311 - Packets 解题报告（贪心）

Packets A factory produces products packed in square packets of the same height h and of the sizes , , , , , . These products are always delivered to customers in the square parce

2014-07-28 16:05:30 794

原创 UVa 254 - Towers of Hanoi 解题报告（递归）

Packets A factory produces products packed in square packets of the same height h and of the sizes , , , , , . These products are always delivered to customers in the square parcels

2014-07-28 15:22:10 913

原创 UVa 120 - Stacks of Flapjacks 解题报告（暴力）

120 - Stacks of FlapjacksTime limit: 3.000 seconds

2014-07-28 13:59:16 567

原创 UVa 110 Meta-Loopless Sorts 解题报告（暴力）

Meta-Loopless Sorts Background Sorting holds an important place in computer science. Analyzing andimplementing various sorting algorithms forms an important part of theeducation of mos

2014-07-28 10:28:42 559

原创 UVa 1533 Moving Pegs 解题报告（暴力+码力）

1533 - Moving PegsTime limit: 3.000 secondsVenture MFG Company, Inc. has made a game board. This game board has 15 holes and these holes are filled with pegs except one hole. A peg can jump over

2014-07-25 20:59:22 938

原创 UVa 1555 Garland 解题报告（推导）

1555 - GarlandTime limit: 3.000 seconds

2014-07-25 16:48:36 695

原创 UVa 1523 Helicopter 解题报告（枚举排列）

1523 - HelicopterTime limit: 3.000 seconds

2014-07-25 15:17:11 688

原创 UVa 10670 Work Reduction 解题报告（贪心）

结题#include #include #include #include #include #include #include #include #include #include #include using namespace std;#define ff(i, n) for(int i=0;i<(n);i++)#define fff(i, n, m) for(

2014-07-25 11:41:49 690

原创 UVa 10318 Security Panel 解题报告（暴力，中途相遇法）

10318 - Security PanelTime limit: 3.000 seconds#include #include #include #include #include #include #include #include #include #include #include using namespace std;#define ff(i

2014-07-25 10:49:19 800

原创 HDU 4876 ZCC loves cards （2014多校联合训练第二场1005）解题报告（暴力+剪枝）

ZCC loves cardsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 670 Accepted Submission(s): 130Problem DescriptionZCC loves pl

2014-07-24 23:30:25 1218 1

原创 UVa 10317 Equating Equations 解题报告（暴力）

Problem FEquating EquationsInput: standardinputOutput: standardoutputTime Limit: 6 secondsMemory Limit: 32MB Read equations with up to 16 terms and + and– operators (not unary) and reo

2014-07-24 16:30:32 594

原创 UVa 10012 How Big Is It? 解题报告（枚举排列）

How Big Is It? Ian's going to California, and he has to pack his things, including hiscollection of circles. Given a set of circles, your program mustfind the smallest rectangular box in w

2014-07-23 21:49:41 731

原创 UVa 1508 Equipment 解题报告（枚举子集）

UVa网页上看不到题目，点PDF就有。

2014-07-23 20:36:15 678

原创 UVa 1420 Priest John's Busiest Day 解题报告（贪心）

1420 - Priest John's Busiest DayTime limit: 3.000 secondsJohn is the only priest in his town. October 26th is the John's busiest day in a year because there is an old legend in the town that the

2014-07-23 17:01:15 824

原创 UVa 1419 Ugly Windows 解题报告（水题）

1419 - Ugly WindowsTime limit: 3.000 secondsSheryl works for a software company in the country of Brada. Her job is to develop a Windows operating system. People in Brada are incredibly conserva

2014-07-23 15:55:07 568

原创 UVa 1153 Keep the Customer Satisfied 解题报告（贪心）

1153 - Keep the Customer SatisfiedTime limit: 3.000 seconds

2014-07-23 15:07:00 783

原创 UVa 1316 Supermarket 解题报告（贪心）

1316 - SupermarketTime limit: 3.000 seconds

2014-07-23 11:34:03 1030

原创 UVa 1467 Installations 解题报告（贪心）

1467 - InstallationsTime limit: 3.000 secondsIn the morning, service engineers in a telecom company receive a list of jobs which they must serve today. They install telephones, internet, ipTVs, et

2014-07-23 09:12:44 1030

原创 HDU 4864 Task (2014多校联合训练第一场1004) 解题报告（贪心）

TaskTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 400 Accepted Submission(s): 72Problem DescriptionToday the company has m

2014-07-22 20:08:20 1251

原创 HDU 4869 Turn the pokers (2014多校联合训练第一场1009) 解题报告（维护区间 + 组合数）

Turn the pokers

2014-07-22 20:03:29 802

原创 UVa 1392 DNA Regions 解题报告（二分）

#include #include #include #include #include #include #include #include #include #include using namespace std;#define ff(i, n) for(int i=0;i<(n);i++)#define fff(i, n, m) for(int i=(n);i<=

2014-07-21 19:10:49 809

原创 UVa 1481 Genome Evolution 解题报告（枚举）

1481 - Genome EvolutionTime limit: 3.000 secondsXi, a developmental biologist is working on developmental distances of chromosomes. A chromosome, in the Xi's simplistic view, is a permutation fr

2014-07-21 16:02:46 923

原创 UVa 12265 Selling Land 解题报告（降维）

G Selling LandAs you may know, the country of Absurdistan is full ofabnormalities. For example, the whole country can be divided into unitsquares that are either grass or swamp. Also, the country i

2014-07-21 11:45:49 1134

原创 UVa 1432 Fire-Control System 解题报告（离散化 + 扫描）

1432 - Fire-Control SystemTime limit: 3.000 seconds

2014-07-19 19:49:02 882 3

原创 UVa 1451 Average 解题报告（斜率优化）

1451 - AverageTime limit: 3.000 secondsA DNA sequence consists of four letters, A, C, G, and T. The GC-ratio of a DNA sequence is the number of Cs and Gs of the sequence divided by the length of

2014-07-19 18:03:02 1380 1

原创 UVa 10827 Maximum sum on a torus 解题报告（前缀和）

Problem HMaximum sum on a torusInput: Standard InputOutput: Standard Output Agrid that wraps both horizontally and vertically is called a torus. Given atorus where each cell contains an inte

2014-07-19 13:02:55 647

原创 UVa 1325 Hypertransmission 解题报告（扫描线）

1325 - HypertransmissionTime limit: 6.000 seconds

2014-07-19 11:10:10 814

原创 UVa 1312 Cricket Field 解题报告（枚举 + 离散化）

1312 - Cricket FieldTime limit: 3.000 seconds

2014-07-19 10:08:37 907

原创 UVa 10125 - Sumsets 解题报告（中途相遇法）

解题报告： a + b + c = d，也就是#include #include #include #include #include #include #include #include #include using namespace std;#define ff(i, n) for(int i=0;i<(n);i++)#define fff(i, n, m)

2014-07-18 20:25:17 664

原创 UVa 1382 Distant Galaxy 解题报告（枚举 + 前缀和）

1382 - Distant GalaxyTime limit: 3.000 secondsYou are observing a distant galaxy using a telescope above the Astronomy Tower, and you think that a rectangle drawn in that galaxy whose edges are

2014-07-18 16:38:23 1167