龙崎的专栏

Bomb GameProblem DescriptionRobbie is playing an interesting computer game. The game field is an unbounded 2-dimensional region. There are N rounds in the game. At each round, the computer will give Ro

E. Breaking Good Breaking Good is a new video game which a lot of gamers want to have. There is a certain level in the game that is really difficult even for experienced gamers. Walter William

ProblemD: Airport Express In a small city called Iokh, a train service, Airport-Express, takes residents to the airport more quickly than other transports. There are two types of trains in Airport-

Online Judge Online Exercise Online Teaching Online Contests Exercise Author F.A.Q Hand In Hand Online Acmers Forum | Discuss Statistical Charts Problem Archive Realtime Judge Statu

Problem C: A Walk Through the Forest Jimmy experiences a lot of stress at work these days, especially sincehis accident made working difficult. To relax after a hard day, helikes to walk home. To mak

D - Black Spot Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Status Description Bootstrap: Jones's terrible leviathan will find you and drag the

A. Jzzhu and Children time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There are n children in Jzzhu's school. Jzzhu is

输出欧拉回路或者欧拉路径长度，

Description  There are n countries at planet X on which Xiao Ming was born.   Some countries, which have been sharing fine bilateral relations, form a coalition and thus all of their citizens w

距离小于10的可以走，距离大的初始化为INF，求最短路里最长的。 下面是代码： #include #include #include #include #include using namespace std; const double INF=100000000000; struct coord { int x,y; }down[105]; double grid[105][105]

Wormholes  In the year 2163, wormholes were discovered. A wormhole is a subspace tunnel through space and time connecting two star systems. Wormholes have a few peculiar properties: Worm

非常裸的最短路。 下面是代码： #include #include #include #include using namespace std; const int MAX_M=50010; const int MAX_N=20010; const int INF=2000000000; struct node { int u,next,len; }edge[MAX_M*2]; int

Problem 2186 小明的迷宫 Accept: 45    Submit: 138 Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description 小明误入迷宫，塞翁失马焉知非福，原来在迷宫中还藏着一些财宝，小明想获得所有的财宝并离开迷宫。因为小明还是学生，还有家庭作业要做，所以他想尽快获得所

Shortest-path tree Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 130712/130712 K (Java/Others) Total Submission(s): 840    Accepted Submission(s): 253 Problem Description Given a con

A: http://acm.hust.edu.cn/vjudge/contest/view.action?cid=83690#problem/A 题意：N*M的格子，从左上走到右下，要求在每个点的权值必须大于0，问起始的时候必须有多少能量 思路：二分答案#include<iostream> #include<cstdio> #include<string> #include<cstring> #

Prison BreakProblem DescriptionRompire is a robot kingdom and a lot of robots live there peacefully. But one day, the king of Rompire was captured by human beings. His thinking circuit was changed by h

欢迎参加——每周六晚的BestCoder（有米！） Average Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1748 Accepted Submission(s): 447 Special JudgeProblem

C. Geometric ProgressionPolycarp loves geometric progressions very much. Since he was only three years old, he loves only the progressions of length three. He also has a favorite integer k and a sequen

C. Geometric ProgressionPolycarp loves geometric progressions very much. Since he was only three years old, he loves only the progressions of length three. He also has a favorite integer k and a sequen

感觉还是lrj的Dijkstra模板高端一些，准备一份struct Edge { int from,to,dist; Edge(int f=0,int t=0,int d=0):from(f),to(t),dist(d){} }; struct HeapNode//优先队列节点 { int d,u; HeapNode(int _d=0,int _u=0):d(_d),

Tricks DeviceProblem DescriptionInnocent Wu follows Dumb Zhang into a ancient tomb. Innocent Wu’s at the entrance of the tomb while Dumb Zhang’s at the end of it. The tomb is made up of many chambers,

数长方形 小度熊喜欢玩木棒。一天他在玩木棒的时候，发现一些木棒会形成长方形。小度熊可能是处女座吧，他只会将木棒横竖摆放，这样会形成很多长方形。现在给你一些横竖摆放的木棒，请你帮小度熊数一数形成了多少个长方形。 为了简化题目，一个木棒的端点不会在另一个木棒上，也就是说，木棒的端点不会在长方形上。 Input 第一行一个整数T，表示T组数据，不超过100组。

E. Paths and Trees Little girl Susie accidentally found her elder brother's notebook. She has many things to do, more important than solving problems, but she found this problem too interesting

B. Destroying Roads In some country there are exactly n cities and m bidirectional roads connecting the cities. Cities are numbered with integers from 1 to n. If cities a and b are connected

Mart Master II Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 328    Accepted Submission(s): 108 Problem Description Trader Dogy live

转自：http://blog.youkuaiyun.com/pi9nc/article/details/12421417 差分约束系统： 如果一个系统由n个变量和m个约束条件组成，其中每个约束条件形如xj-xi         差分约束可以转化话单源最短路求解。因为单源最短路径满足三角不等式d[v] = 只要改变一下初始化条件即可。           差分约束题目有两种，一

Language: Default Intervals Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 19858   Accepted: 7509 Description You are given n closed, integer interval

Language: Default Optimal Milking Time Limit: 2000MS   Memory Limit: 30000K Total Submissions: 10381   Accepted: 3768 Case Time Limit: 1000MS Description FJ ha

Language: Default Six Degrees of Cowvin Bacon Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2221   Accepted: 1036 Description The cows have been maki

Language: Default Roadblocks Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 5726   Accepted: 2167 Description Bessie has moved to a small farm and som

网上说这道题属于基本题，但我觉得构图不好构，构完图就是裸的最短路。 最近老发迷糊，在细节上花太多时间，不是这犯点错，就是那犯点错，归结起来有些浮躁啊！给自己点冷水，静一静。 #include #include #include #include #include using namespace std; const int inf=1000000000; struct node { i

Language: Default Heavy Transportation Time Limit: 3000MS   Memory Limit: 30000K Total Submissions: 17946   Accepted: 4733 Description Background  Hugo Heavy is ha

以为自己会写了，可写起来还是要看模板。。。真是很不熟，而且理解不到位啊，纠结了半天，本来想，只知道一种的本金，怎么比较啊，真是笨死了，bellman本来初始化就是都不知道，然后一步一步的逼近。。。。。。 还在double上wa了，细节啊！ #include #include #include using namespace std; int N,M,S; double sum; //int

转自点击打开链接 dijkstra算法是会写了，但这个题还是没做出来，不知道那个等级制度怎么用，人家的代码写的很详细！ 每个物品看成一个节点，酋长的允诺也看作一个物品， 如果一个物品加上金币可以交换另一个物品， 则这两个节点之间有边，权值为金币数，求第一个节点到所有节点的最短路。 因为有等级限制，所以枚举每个点作为最低等级，选取符合所有符合等级限制的点     最短路问题，不

Til the Cows Come Home Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 24926   Accepted: 8369 Description Bessie is out in the field and wants to get back to t

Invitation Cards Time Limit: 8000MS   Memory Limit: 262144K Total Submissions: 16938   Accepted: 5501 Description In the age of television, not many people attend theater p

比较简单的一道最短路，他要求所有的最短路中最小的，直接用floyed-warshall算法即可。 题意：有很多人传播谣言，给出每个人对其他人传播谣言的时间，求那个人传播给所有人后时间最短。 思路：简单的floyed-warshall算法，刚开始的时候初始化，出了点问题，初始化视情况而定。 #include #include #include #include #include using n

题意：求从第一个人到其他所有人的传播的最短时间，可以同时传给很多人。 思路：Dijkstra算法求最短路，其中最大的就是需要的最小时间。 #include #include #include #include #include using namespace std; int map[110][110]; int dis[110]; int n; void dijstra() { bo

warshall算法： warshall算法是求二元关系穿闭包的算法.设关系R的关系图为G，设图G的所有顶点为v1,v2,…,vn，则t(R)的关系图可用该方法得到：若G中任意两顶点vi和vj之间有一条路径且没有vi到vj的弧，则在图G中增加一条从vi到vj的弧，将这样改造后的图记为G’，则G’即为t(R)的关系图。G’的邻接矩阵A应满足：若图G中存在从vi到vj路径，即vi与vj连通，则A[i

Language: Default Big Christmas Tree Time Limit: 3000MS   Memory Limit: 131072K Total Submissions: 19552   Accepted: 4196 Description Christmas is coming to KCM c