Cities

[Codeforces Round #192 (Div. 2)] B. Road Construction

megabytes input standard input output standard output   A country has n cities
·2015-11-11 05:56

[POJ] 1724 ROADS

Limit: 65536K Total Submissions: 9971   Accepted: 3706 Description N cities
·2015-11-11 05:50

codeforces 144D Missile Silos(最短路)

     ——by fraud   Missile Silos A country called Berland consists of n cities
·2015-11-11 02:16

hdu 2874 Connections between cities(lca->rmq)

Connections between cities Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768
·2015-11-11 00:32

Battle Over Cities (25)（DFS、连通图）

      It is vitally important to have all the cities connected by highways in a war
·2015-11-11 00:20

HDOJ Monthly Contest – 2010.04.04

1001  Connect the Cities   最小生成树，先构造已经存在的路，然后再建路 ，1y 1008  San Guo Sha 背景是三国杀游戏，由于游戏的规则没有完全懂
·2015-11-10 23:24

hdu 3371 Connect the Cities

链接：hdu 3371 已知已连通的路的序号，以及未连通的路的费用，求将全部城市连通的最小费用 也是将已连通的路的费用记为0，就转化成了基本最小生成树的题 只是这题数组要开的大点，不然非常easy就RE了、、、 #include<cstdio> #include<algorithm> using namespace std; int f[510],n,m; s
·2015-11-10 22:11

【Codeforces Round 326 (Div 2)E】【树链剖分】Duff in the Army 树上给定路径上编号最小的几个人

E.DuffintheArmytimelimitpertest4secondsmemorylimitpertest512megabytesinputstandardinputoutputstandardoutputRecentlyDuffhasbeenasoldierinthearmy.Malekishercommander.Theircountry,AndarzGuhas n cities
snowy_smile·2015-11-10 11:00

PAT 1013 Battle Over Cities

#include <cstdio> #include <cstdlib> #include <vector> using namespace std; class City { public: vector<int> adj; bool visited; City() : visited(false)
·2015-11-09 14:10

hdu 1385 ZOJ 1456 Minimum Transport Cost（经典floyd）

Transport Cost Time Limit: 2 Seconds      Memory Limit: 65536 KB These are N cities
·2015-11-08 16:12

CF Destroying Roads (最短路)

input standard input output standard output In some country there are exactly n cities
·2015-11-08 16:47

1030. Travel Plan (30)

代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A traveler's map gives the distances between cities
·2015-11-08 15:24

有限制的最短路spfa+优先队列

Limit: 65536K Total Submissions: 10751   Accepted: 3952 Description N cities
·2015-11-08 14:53

TJU1167 The Settlers of Catan +比赛总结

1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities
·2015-11-07 15:29

HDU 4606 Occupy Cities ★(线段相交+二分+Floyd+最小路径覆盖)

题意 有n个城市，m个边界线，p名士兵。现在士兵要按一定顺序攻占城市，但从一个城市到另一个城市的过程中不能穿过边界线。士兵有一个容量为K的背包装粮食，士兵到达一个城市可以选择攻占城市或者只是路过，如果攻占城市，就能装满背包。从城市到城市消耗的粮食等于两城市的距离，如果距离大于士兵当前的背包的容量，士兵就不能走这条路。士兵可以选择空降一次，空降不耗费。求p个士兵攻占所有城市所需要的最小背包容量k。
·2015-11-07 15:35

HDU 4606 Occupy Cities ★(线段相交+二分+Floyd+最小路径覆盖)

题意 有n个城市，m个边界线，p名士兵。现在士兵要按一定顺序攻占城市，但从一个城市到另一个城市的过程中不能穿过边界线。士兵有一个容量为K的背包装粮食，士兵到达一个城市可以选择攻占城市或者只是路过，如果攻占城市，就能装满背包。从城市到城市消耗的粮食等于两城市的距离，如果距离大于士兵当前的背包的容量，士兵就不能走这条路。士兵可以选择空降一次，空降不耗费。求p个士兵攻占所有城市所需要的最小背包容量k。
·2015-11-07 15:20

HDU 3371 Connect the Cities

Connect the Cities Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768
·2015-11-07 15:33

树形DP 2013多校8（Terrorist’s destroy HDU4679）

But now he is alone, he can only destroy one road, then the city will be divided into two cities.
·2015-11-07 12:56

HDU 1025 Constructing Roads In JGShining's Kingdom （DP）

Problem Description JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which
·2015-11-07 11:36

Timusoj 1982. Electrification Plan

Electrification Plan Time limit: 0.5 second Memory limit: 64 MB Some country has  n cities
·2015-11-07 11:18

BestCoder Round #32——1001——PM2.5

So we sort the cities according to t
·2015-11-07 10:34

HDU1025——LIS——Constructing Roads In JGShining's Kingdom

Problem Description JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which
·2015-11-03 22:15

HDU 2874 Connections between cities

这个题搞的我好纠结呀！一直是WA，后来才知道自己记录的时候搞错了，ans应该为-1而不是0，因为当时同一个点时，距离为0； 这里要用到LCA，我们的距离为两个子节点到根的距离和减去最近祖先的距离的2倍； #include<cstdio>#include<iostream>#include<string.h>#include<vector>usi
·2015-11-02 18:38

HDU 3371 Connect the Cities

我用G++提交就TLE了，而用C++提交就过了，这题就是一个并查集与克鲁斯卡尔。 #include<stdio.h>#include<stdlib.h>struct t{ int x,y,cost; }kru[25024];int set[524];int cmp( const void *a,const void *b ){ return (
·2015-11-02 18:23

HDOJ---3371 Connect the Cities[kruskal算法]

  Connect the Cities Time Limit: 2000/1000 MS (Java/Others)    Memory Limit
·2015-11-02 15:22

HDU 1688 Sightseeing

#include #defineMAX_CITIES1000 #defineMAX_ROADS10000 #defineINF1000000 intnumOfCities,numOfRoads
tiutiu2011·2015-11-02 15:00

Ajax-WebService返回简单数组

WebService: [WebMethod] public string[] GetSimpleArray() { string[] cities =
·2015-11-02 10:48

poj1635

nbsp;10000K Total Submissions: 5735   Accepted: 2370 Description Some major cities
·2015-11-02 09:56

UVA 12507 Kingdoms

Memory Limit:0KB     64bit IO Format:%lld & %llu   A kingdom has n cities
·2015-11-01 15:57

HDU1025：Constructing Roads In JGShining's Kingdom(LIS)

Problem Description JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which
·2015-11-01 13:13

hdu 2874 Connections between cities

Problem Description After World War X, a lot of cities have been seriously damaged, and we need to
·2015-10-31 15:10

zoj 1655 Transport Goods

The intruder is attacking the capital so other cities must send supports to the cap
·2015-10-31 15:56

POJ 3067 Japan

Japan is tall island with N cities on the East coast and M cities on the West coast (M <= 1000, N
·2015-10-31 15:22

OC3-xml文件解析

> <xml_api_reply version="1"> <cities> <city>
·2015-10-31 15:46

hdu 2874 Connections between cities

LCA 题意：询问LCA，不过图不连通，如果两点不连通输出那串英文否则输出两点间的距离，模板题 #include <iostream> #include <cstdio> #include <cstring> using namespace std; #define N 10010 #define M 10010 #define Q 10000
·2015-10-31 11:18

hdu 3371（prim算法）

pid=3371 Connect the Cities Time Limit: 2000/1000 MS (Java/Others)    Memory Limit
·2015-10-31 11:55

hdu4435 charge-station

/Others) Total Submission(s): 610 Accepted Submission(s): 306 Problem Description There are n cities
·2015-10-31 10:20

hdu 5148 cities 树形DP

*******************************bestcoder题解********************************Cities 选出K个点v1,v2,...vK使得∑
·2015-10-31 10:37

HDU4606 Occupy Cities 计算几何+最小路径覆盖

题目大意如下 在一个二维坐标系中，有n个城市，坐标给出来了，然后有p个士兵要去占领这n个城市，但是路上有m个路障，都是线段，士兵不能越过路障前进。 每个士兵都有相同容量大小的一个干粮袋，每到一个城市他就能补充满自己的干粮袋。中途走路时走一个单位长度就消耗一个单位的干粮。 现在问的是这些个干粮袋最小的容量是多少，前提是保证p个士兵能占领完这n个城市，城市被占领顺序也是题目给好的，必须遵守
·2015-10-31 09:45

[HDU] 3371 Connect the Cities [最小生成树,并查集,Kruskal]

题目来源：HDU 3371 [HDOJ Monthly Contest – 2010.04.04] 题目大意：输入一个T，代表有总共有T组测试数据，接下来一行输入n,m,k，其中n(3<=n<=500)表示城市的个数，m(0<=m<=25000)表示可以选择桥的个数，k(0<=k<=100)表示已连接的分块个数。接着，输入m行可供选择的桥的参数p,q,r，表示
·2015-10-31 09:46

HDU 3371 Connect the Cities

并查集+set容器 Kruskal #include < stdio.h > #include < string .h > #include < set > using namespace std; const
·2015-10-31 09:46

Codeforces Round #302 (Div. 2) D - Destroying Roads 图论，最短路

题目连接 http://codeforces.com/contest/544/problem/D Description In some country there are exactly n cities
·2015-10-31 08:02

POJ 3767

Submissions: 2488   Accepted: 1041 Description The country is facing a terrible civil war----cities
·2015-10-30 15:29

Codeforces 449B

Jzzhu and Cities time limit per test 2 seconds memory limit per test 256 megabytes input
·2015-10-30 14:26

每日英语：Easing Gaokao Restrictions: a New Year's Gift?

Major Chinese cities in recent days rolled out plans to loosen restrictions on gaokao, the famously competitive
·2015-10-30 13:29

每日英语：China's Migrant Workers Lingering In Cities

Migrant worker Zhang Kang has a full-time job at an auto factory in this southern Chinese city─and a drive to sell socks. Linger：徘徊，消磨Mr. Zhang, an employee at a BYD Co. assembly plant, sells socks o
·2015-10-30 13:27

CodeForceS#276-B(求最大值)

Valuable Resources   Many computer strategy games require building cities, recruiting army
·2015-10-30 11:37

HDU 2874 Connections between cities LCA水题 注意是森林，不是树

Problem Description After World War X, a lot of cities have been seriously damaged, and we need to
·2015-10-28 08:02

HDU 1025 Constructing Roads In JGShining's Kingdom　　 LIS　简单题　好题　超级坑

Kingdom Problem Description JGShining's kingdom consists of 2n(n is no more than 500,000) small cities
·2015-10-28 08:57

Hdu 2874(LCA)

题目链接 Connections between cities Time Limit: 10000/5000 MS (Java/Others)    Memory
·2015-10-27 15:20
上一页 7 8 9 10 11 12 13 14 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他