2013年07月_twobqn123

原创 HDU2480(贪心+并查集)

G - G Time Limit:6000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 2480 Description The alliance of thieves decides to steal the treasure from country

2013-07-25 22:22:50 541

原创 poj2250(简单的二叉树问题) Tree Recovery

Tree Recovery Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9620 Accepted: 6041 Description Little Valentine liked playing with binary trees very much. Her

2013-07-24 20:25:00 489

原创 poj 1129 DFS+四色问题 Channel Allocation

Channel Allocation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 10773 Accepted: 5523 Description When a radio station is broadcasting over a very large ar

2013-07-22 21:08:53 555

原创 DFS (poj 1111) Image Perimeters

Image Perimeters Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7081 Accepted: 4231 Description Technicians in a pathology lab analyze digitized images of s

2013-07-22 14:54:40 567

原创 ZOJ 1008(DFS+剪枝) Gnome Tetravex

Gnome Tetravex Time Limit: 10 Seconds Memory Limit: 32768 KB Hart is engaged in playing an interesting game, Gnome Tetravex, these days. In the game, at the beginning, the player is give

2013-07-22 11:55:51 922

原创 DFS_ZOJ1002

Fire Net Time Limit: 2 Seconds Memory Limit: 65536 KB Suppose that we have a square city with straight streets. A map of a city is a squareboard with n rows and n columns, each represent

2013-07-22 01:46:43 520

原创 POJ1564(DFS构造法) Sum It Up

Sum It Up Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5378 Accepted: 2714 Description Given a specified total t and a list of n integers, find all distin

2013-07-21 17:55:47 462

原创 poj3984(DFS写法) 迷宫路径问题

迷宫问题 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6113 Accepted: 3540 Description 定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0,

2013-07-21 16:43:47 942 1

原创 poj3984（BFS）迷宫路径

迷宫问题 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6112 Accepted: 3539 Description 定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0,

2013-07-21 16:18:44 585

原创 Dijkatra+Head_poj3268

Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10312 Accepted: 4574 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently

2013-07-21 13:53:35 685

原创 poj2457(Dijkstra+priory-_queue)

Part Acquisition Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3067 Accepted: 1320 Special Judge Description The cows have been sent on a mission throu

2013-07-21 03:39:38 561

原创 poj2983(差分约束系统)Is the Information Reliable?

Is the Information Reliable? Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 9855 Accepted: 3061 Description The galaxy war between the Empire Draco and t

2013-07-21 00:03:45 690

原创 poj2387_spfa

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

2013-07-20 16:48:36 522

原创 POJ3159 差分约束系统

Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissions: 20396 Accepted: 5404 Description During the kindergarten days, flymouse was the monitor of his cla

2013-07-20 14:38:07 577

转载很棒一个差分约束系统的理解，希望对你有帮助，果断转了

差分约束系统(System Of Difference Constraints) （本文假设读者已经有以下知识：最短路径的基本性质、Bellman-Ford算法。）比如有这样一组不等式： X1 - X2 X1 - X5 X2 - X5 X3 - X1 X4 - X1 X4 - X3 X5 - X3 X5 - X4

2013-07-20 00:54:11 632

原创 poj2240（Floyd最短路的变种---最长路）Arbitrage

Arbitrage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12761 Accepted: 5392 Description Arbitrage is the use of discrepancies in currency exchange rates t

2013-07-19 17:15:00 641

转载 Floyd 算法原理

[转] Floyd 算法原理 floyd算法是一个经典的动态规划算法。用通俗的语言来描述的话，首先我们的目标是寻找从点i到点j的最短路径。从动态规划的角度看问题，我们需要为这个目标重新做一个诠释（这个诠释正是动态规划最富创造力的精华所在），floyd算法加入了这个概念 Ak(i,j)：表示从i到j中途不经过索引比k大的点的最短路径。这个限制的重要之处在于，它将最

2013-07-19 16:03:40 1231

原创 poj 1363(Stack ) Rails

Rails Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21050 Accepted: 8404 Description There is a famous railway station in PopPush City. Country there is in

2013-07-19 14:18:27 692

原创 poj 1847（floyd） Tram

Tram Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 8548 Accepted: 3093 Description Tram network in Zagreb consists of a number of intersections and rails c

2013-07-19 02:23:54 641

原创 DP DAG 9-3硬币问题（算法竞赛入门经典p162)

有n种硬币，面值分别为V1，V2，V3，.....Vn，每种都有无限多。给定非负整数S，可以选用多少个硬币，使得面值之和恰好为S？输出硬币数目的最小值和最大值。1=100, 0 思路：本题是固定终点和起点的DAG动态规划。我们把每种面值看做一个点，表示“还需要凑足的面值”，则初始状态为S，目标状态为0。如当前在状态i，没使用一个硬币j，状态变转移到i-Vj。我对于这道题目的意义就是

2013-07-18 22:08:57 2067 3

原创 DP-DAG uva_103 Stacking Boxes

Stacking Boxes Background Some concepts in Mathematics and Computer Science are simple in one or two dimensions but become more complex when extended to arbitrary dimensions. Consider sol

2013-07-18 14:11:03 589

twobqn123的专栏