UVA
文章平均质量分 78
_Occult_
物語が始まった
展开
-
UVA 10600 ACM Contest and Blackout
求最小和次小生成树的权值和,先求出最小生成树,然后枚举剩下的边,判断如果用这条作为替代得到的生成树里,最小的那个是次小。因为点数很少,可以直接暴力的求出全图所有点之间的最大边。#include #include #include #include #include using namespace std;#define ms(x,y) memset(x,y,sizeo原创 2016-12-15 14:56:01 · 201 阅读 · 0 评论 -
UVA 10714 Ants
An army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two ants meet they t原创 2015-02-18 13:59:16 · 380 阅读 · 0 评论 -
UVA 10020 Minimal coverage
http://uva.onlinejudge.org/external/100/10020.pdf给定n条线段,问最少用几条可以覆盖0到M。按左端排序,每次选最长的(贪心)#include#include #include#include#include#include#includeusing namespace std;const int maxn =原创 2015-02-18 13:55:26 · 412 阅读 · 0 评论 -
UVA 10706 Number Sequence
Number SequenceInput: standard inputOutput: standard outputTime Limit: 1 secondA single positive integer iis given. Write a program to find the digit located in the position iin the sequen原创 2015-02-18 13:47:11 · 470 阅读 · 0 评论 -
UVA 10132 File Fragmentation
http://uva.onlinejudge.org/external/101/10132.pdf简单来说就是有很多一样的被切成两片,现在给你碎片,问原来的样子。按长度排个序,把最短的和最长的拼起来试一试就好了。输入处理要弄好#include #include#include#include#include#include#include#include原创 2015-02-18 13:33:42 · 407 阅读 · 0 评论 -
UVA 437 The Tower of Babylon
Perhaps 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 the educational nature of this contest, we will tell you the原创 2015-02-17 21:18:15 · 425 阅读 · 0 评论 -
UVA 10474 Where is the Marble?
Raju and Meena love to play with Marbles. They have got a lot of marbles with numbers written on them. At the beginning, Raju would place the marbles one after another in ascending order of the number原创 2015-02-17 14:45:00 · 320 阅读 · 0 评论 -
UVA 10905 Children's Game
4thIIUCInter-University Programming Contest, 2005AChildren’s GameInput: standard inputOutput: standard outputProblemsetter: Md. KamruzzamanThere原创 2015-02-17 21:54:29 · 452 阅读 · 0 评论 -
UVA 10003 Cutting Sticks
点击打开链接区间dp问题,搞清楚转移方程就好了,一段区间的最小值就是两段之和加上区间的长度。#include #include#include#include#include#includeusing namespace std;const int maxn = 60;int i, j, k, n, f[maxn][maxn], length, a[maxn];int原创 2015-02-17 20:52:10 · 330 阅读 · 0 评论 -
UVA 331 Mapping the Swaps
Sorting an array can be done by swapping certain pairs of adjacent entries in the array. This is the fundamental technique used in the well-known bubble sort. If we list the identities of the pairs to原创 2015-02-17 15:13:08 · 359 阅读 · 0 评论 -
UVA 539 The Settlers of Catan
Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities across its uncharted wilderness.You are employed by a so原创 2015-02-17 14:56:13 · 378 阅读 · 0 评论 -
UVA 216 Getting in Line
Computer networking requires that the computers in the network be linked.This problem considers a ``linear" network in which the computers are chained together so that each is connected to exa原创 2015-02-17 14:49:36 · 348 阅读 · 0 评论 -
UVA 146 ID Codes
It is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to counter a chronic breakdown in law and order, t原创 2015-02-17 13:47:03 · 419 阅读 · 0 评论 -
UVA 307 Sticks
George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had orig原创 2015-02-17 14:02:20 · 556 阅读 · 0 评论 -
UVA 348 Optimal Array Multiplication Sequence
Given two arrays A and B, we can determine the array C = AB using the standard definition of matrix multiplication:The number of columns in the A array must be the same as the number of ro原创 2015-02-17 21:04:38 · 362 阅读 · 0 评论 -
UVA 11354 Bond
最小生成树+树链剖分+rmq#include#include#include#include#includeusing namespace std;#define ms(x,y) memset(x,y,sizeof(x))#define rep(i,j,k) for(int i=j;i<=k;i++)#define loop(i,j,k) for (int i=j;i!=-1;原创 2016-12-07 11:55:53 · 214 阅读 · 0 评论 -
UVA 1395 Slim Span
DescriptionGiven an undirected weighted graph G, you should find one of spanning trees specified as follows.The graph G is an ordered pair (V, E), where V is a set of vertices {v1, v2, …, vn} an原创 2016-12-06 13:27:09 · 294 阅读 · 0 评论 -
UVA 11733 Airports
最小生成森林,其实就是最小生成树的做法,稍加修改即可。#include#include#include#includeusing namespace std;#define rep(i,j,k) for(int i=j;i<=k;i++)#define loop(i,j,k) for (int i=j;i!=-1;i=k[i])#define inone(x) scanf("%d原创 2016-11-30 10:13:06 · 459 阅读 · 0 评论 -
UVA 442 Matrix Chain Multiplication
DescriptionSuppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are perfor原创 2015-08-09 15:23:14 · 362 阅读 · 0 评论 -
UVALive 6092 Catching Shade in Flatland
https://icpcarchive.ecs.baylor.edu/external/60/6092.pdf坐标上有很多相离圆,问一条可以绕原点旋转的线段与这些圆相交的最长弦长之和。直接模拟即可。注意是线段。#include #include#include#includeusing namespace std;int main(){ int n,原创 2015-02-18 14:55:52 · 512 阅读 · 0 评论 -
UVA 193 Graph Coloring
You are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and the only available colors are black and white. The coloring of the原创 2015-02-17 15:36:43 · 412 阅读 · 0 评论 -
UVA 590 Always on the run
Screeching tires. Searching lights. Wailing sirens. Police cars everywhere. Trisha Quickfinger did it again! Stealing the `Mona Lisa' had been more difficult than planned, but being the world's best a原创 2015-02-17 21:50:59 · 369 阅读 · 0 评论 -
UVA 10700 Camel trading
Camel tradingTime Limit: 1 secondBackgroundAroud 800 A.D., El Mamum, Calif of Baghdad was presented the formula 1+2*3*4+5, which had its origin in the financial accounts of a cam原创 2015-02-18 13:50:25 · 454 阅读 · 0 评论 -
UVA 10954 Add All
Add AllInput: standard inputOutput: standard outputYup!! The problem name reflects your task; just add a set of numbers. But you may feel yourselves condescended, to write a C/C++ program ju原创 2015-02-18 14:02:37 · 448 阅读 · 0 评论 -
UVA 10404 Bachet's Game
Bachet's GameBachet's game is probably known to all but probably not by this name. Initially there are n stones on the table. There are two players Stan and Ollie, who move alternately. Stan alw原创 2015-02-17 21:21:32 · 419 阅读 · 0 评论 -
UVA 531 Compromise
In a few months the European Currency Union will become a reality. However, to join the club, the Maastricht criteria must be fulfilled, and this is not a trivial task for the countries (maybe except原创 2015-02-17 21:13:53 · 422 阅读 · 0 评论 -
UVA 10167 Birthday Cake
切蛋糕,平分上面的樱桃,数据小,直接暴力即可。#include #include #include using namespace std;struct abc{ int x, y;};int n, i, j, k, n1, n2;abc z[100];int main(){ while (scanf("%d", &n) != EOF&&n) { for (i =原创 2015-02-17 13:23:46 · 562 阅读 · 0 评论 -
UVA 10051 Tower of Cubes
http://uva.onlinejudge.org/external/100/10051.pdfDIS变形,多了方向和路径。#include#include#include#include#includeusing namespace std;const int maxn = 505;int a[maxn][6], f[maxn][6], p[maxn][6][2], b[原创 2015-02-17 21:48:27 · 768 阅读 · 0 评论 -
UVA 620 Cellular Structure
A chain of connected cells of two types A and B composes a cellular structure of some microorganisms of species APUDOTDLS.If no mutation had happened during growth of an organism, its cellular cha原创 2015-02-17 21:28:57 · 412 阅读 · 0 评论 -
UVA 1401 Remember the Word
Neal is very curious about combinatorial problems, and now here comes a problem about words. Knowing that Ray has a photographic memory and this may not trouble him, Neal gives it to Jiejie.Since原创 2015-02-17 15:31:49 · 564 阅读 · 0 评论 -
UVA 10012 How Big Is It?
点击打开链接一定要注意边界的问题,第二个及以后的圆不一定是与它相邻的圆相切的,右边界也是。#include#include#include#include#include#includeusing namespace std;const int maxn = 10;int t, n;int b[maxn], c[maxn];double a[maxn], w;原创 2015-02-17 15:18:32 · 356 阅读 · 0 评论 -
UVA 519 Puzzle (II)
Little Barborka has just started to learn how to solve a picture puzzle. She has started with a small one containing 15 pieces. Her daddy tries to solve the puzzle too. To make it a little bit harder原创 2015-02-17 14:14:37 · 439 阅读 · 0 评论 -
UVA 11205 The broken pedometer
The ProblemA marathon runner uses a pedometer with which he is having problems. In the pedometer the symbols are represented by seven segments (or LEDs):But the pedometer does not work pro原创 2015-02-17 13:27:15 · 530 阅读 · 0 评论 -
UVA 11100 The Trip, 2007
The Trip, 2007A number of students are members of a club that travels annually to exotic locations. Their destinations in the past have included Indianapolis, Phoenix, Nashville, Philadelphia, San原创 2015-02-18 14:23:38 · 450 阅读 · 0 评论 -
UVA 10382 Watering Grass
Watering GrassInput: standard inputOutput: standard outputTime Limit: 3 secondsn sprinklers are installed in a horizontal strip of grass l meters long and w meters wide. Each sprinkler is原创 2015-02-18 14:14:44 · 423 阅读 · 0 评论 -
UVA 270 Lining Up
How am I ever going to solve this problem?" said the pilot.Indeed, the pilot was not facing an easy task. She had to drop packages at specific points scattered in a dangerous area. Furthermore原创 2015-02-18 13:38:18 · 455 阅读 · 0 评论 -
UVA 116 Unidirectional TSP
BackgroundProblems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI routing problems is minimizing wir原创 2015-02-17 21:00:05 · 791 阅读 · 0 评论 -
UVA 167 The Sultan's Successors
The Sultan of Nubia has no children, so she has decided that the country will be split into up to k separate parts on her death and each part will be inherited by whoever performs best at some test. I原创 2015-02-17 15:22:44 · 991 阅读 · 1 评论 -
UVA 10720 Graph Construction
Problem CGraph ConstructionTime Limit2 SecondsGraph is a collection of edges E and vertices V. Graph has a wide variety of applications in computer. There are dif原创 2015-02-18 14:18:08 · 446 阅读 · 0 评论 -
UVA 208 Firetruck
The Center City fire department collaborates with the transportation department to maintain maps of the city which reflects the current status of the city streets. On any given day, several streets ar原创 2015-02-17 15:39:20 · 372 阅读 · 0 评论