最短路及其拓展
Dust_Heart
这个作者很懒,什么都没留下…
展开
-
HDOJ 1142 A Walk Through the Forest(最短路+记忆化搜索)
A Walk Through the ForestTime Limit: 2000/1000 MS(Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8599 Accepted Submission(s): 3181Problem DescriptionJimmy原创 2017-05-09 00:30:32 · 303 阅读 · 0 评论 -
2015-2016 Samara Regional Intercollegiate Programming Contest G - Short Path 【好题】
2015-2016 Samara Regional Intercollegiate Programming Contest G - Short Path 【好题】In my opinion, people are divided into two categories: some livein the future while others — in the past. Should it be explained whatcategory did I belong? The mystery I hun原创 2017-09-01 00:54:56 · 502 阅读 · 0 评论 -
2017 Multi-University Training Contest 9 && HDU 6166 Senior Pan 【最短路+思维】
2017 Multi-University Training Contest 9 && HDU 6166 Senior Pan 【最短路+思维】 SeniorPan fails in his discrete math exam again. So he asks Master ZKC to give himgraph theory problems everyday.The task is simple : ZKC will give Pan a directed graph every time,原创 2017-08-23 12:11:08 · 337 阅读 · 0 评论 -
2017 CCPC-WFinal&&HDOJ6026 Deleting Edges
2017 CCPC-WFinal&&HDOJ6026 Deleting EdgesLittleQ is crazy about graph theory, and now he creates a game about graphs andtrees.There is a bi-directional graph with n nodes, labeledfrom 0 to n−1. Every edge hasits length, which is a positive integer ranged原创 2017-07-07 12:16:01 · 435 阅读 · 0 评论 -
差分约束算法总结
差分约束系统一、概念 如果一个系统由n个变量和m个约束条件组成,形成m个形如ai-aj≤k的不等式(i,j∈[1,n],k为常数),则称其为差分约束系统。二、引例给定n个变量和m个不等式,每个不等式的形式为 x[i] - x[j] 。例如当n = 4,m = 5,给出如下图所示的不等式组,求x3 - x0的最大值。原创 2017-06-03 01:48:34 · 14795 阅读 · 2 评论 -
HDOJ 3666 THE MATRIX PROBLEM
THE MATRIX PROBLEMYou have been given a matrix CN*M, each element E of CN*M ispositive and no more than 1000, The problem is that if there exist N numbers a1, a2, … an and M numbers b1, b2, …, bm, which satisfies that each elements in row-i multiplied wit原创 2017-06-03 10:26:55 · 1176 阅读 · 0 评论 -
POJ 1716 Integer Intervals(差分约束)
Integer IntervalsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14689 Accepted: 6226DescriptionAn integer interval [a,b], a Wri原创 2017-06-03 02:15:47 · 2307 阅读 · 1 评论 -
HDOJ 3790 最短路径问题(双关键字最短路)
最短路径问题Time Limit: 2000/1000 MS(Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26248 Accepted Submission(s): 7810Problem Description给你n个点,m条无向边,每条边都有长度d和花费原创 2017-05-10 00:27:21 · 408 阅读 · 0 评论 -
HDOJ 3339 In Action(最短路+01背包)
In ActionTime Limit: 2000/1000 MS(Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5977 Accepted Submission(s): 2010Problem DescriptionSince 1945, when the原创 2017-05-08 22:48:59 · 267 阅读 · 0 评论 -
2018 Multi-University Training Contest 3 &&HDU6331 Walking Plan【最短路DP】
Walking Plan Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Problem DescriptionThere are n intersections in Bytetown, connected with m one way streets. Lit...原创 2018-07-31 20:52:52 · 304 阅读 · 0 评论