蒻菜_羊羊羊的专栏

编程是人造的学科,而数学是神造的学科.

POJ3020 Antenna Placement(二分图匹配 匈牙利算法)

Antenna Placement Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7044   Accepted: 3498 Description The Glob...

2015-03-29 18:03:56

阅读数:316

评论数:0

HDU2063 过山车(二分图匹配-匈牙利算法模版题)

过山车 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12822    Accepted Submission(s): 5628 ...

2015-03-29 15:07:38

阅读数:402

评论数:0

POJ2367(拓扑排序)

Genealogical tree Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 3233   Accepted: 2182   Special Judge Des...

2015-03-25 15:21:40

阅读数:311

评论数:0

POJ2485 Highways(prim和Kruskal最小生成树两种解法)

Highways Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 23459   Accepted: 10850 Description The island nation of Flatopia is...

2015-03-19 11:17:45

阅读数:357

评论数:0

POJ1789 Truck History(prim最小生成树)

Truck History Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 19866   Accepted: 7676 Description Advanced ...

2015-03-19 10:06:33

阅读数:271

评论数:0

POJ Out of Hay(2395 prim最小生成树)

Out of Hay Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 11814   Accepted: 4628 Description The cows have ...

2015-03-18 22:30:36

阅读数:278

评论数:0

POJ2240 Arbitrage(floyd算法的变形运用)

Arbitrage Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 16745   Accepted: 7035 Description Arbitrage is ...

2015-03-18 13:58:09

阅读数:267

评论数:0

16进制转8进制(较为巧妙的做法)

#include #include using namespace std; const int maxn = 10011; int main() { int T; cin>>T; while(T--) { string a,b; ...

2015-03-17 19:00:56

阅读数:350

评论数:0

POJ1125 Stockbroker Grapevine(最短路floyd算法)

Stockbroker Grapevine Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 28312   Accepted: 15711 Description Stockbrokers are kn...

2015-03-17 16:39:32

阅读数:238

评论数:0

POJ2253 Frogger(floyd最短路算法)

Frogger Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 27654   Accepted: 8999 Description Freddy Frog is ...

2015-03-17 15:01:14

阅读数:217

评论数:0

POJ1062 昂贵的聘礼(dijkstra最短路)

昂贵的聘礼 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 38753 Accepted: 11216 Description 年轻的探险家来到了一个印第安...

2015-03-16 18:31:07

阅读数:318

评论数:0

POJ3259 Wormholes(Bellman-ford 负环)

Wormholes Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 33194   Accepted: 12085 Description While expl...

2015-03-15 14:09:13

阅读数:233

评论数:0

POJ1860 Currency Exchange(Bellman-ford的变形)

Currency Exchange Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 21433   Accepted: 7680 Description Sever...

2015-03-15 11:05:41

阅读数:258

评论数:0

POJ1573 Robot Motion(模拟)

Robot Motion Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 11082   Accepted: 5388 Description A robot has been programme...

2015-03-11 22:21:08

阅读数:316

评论数:0

POJ1068 Parencodings(模拟)

Parencodings Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 20763   Accepted: 12480 Description Let S = s...

2015-03-11 14:01:45

阅读数:305

评论数:0

POJ3295 Tautology(栈和枚举的应用)

Tautology Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10073   Accepted: 3832 Description WFF 'N PROO...

2015-03-10 17:49:24

阅读数:258

评论数:0

POJ2586 Y2K Accounting Bug(贪心)

Y2K Accounting Bug Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10975   Accepted: 5520 Description Accounting for Computer...

2015-03-09 20:36:55

阅读数:386

评论数:0

POJ1328 Radar Installation(区间覆盖)

Radar Installation Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 57054   Accepted: 12867 Description Assume the coasting is...

2015-03-09 15:21:12

阅读数:245

评论数:0

线段区间覆盖代码

题目: 区间长度8,可选的覆盖线段[2,6],[1,4],[3,6],[3,7],[6,8],[2,4],[3,5],求最小的能覆盖全部区间的段数. 自己写的代码: #include #include #include using namespace std; const int max...

2015-03-08 21:58:08

阅读数:280

评论数:0

区间覆盖问题(贪心)

1)区间完全覆盖问题 问题描述:给定一个长度为m的区间,再给出n条线段的起点和终点(注意这里是闭区间),求最少使用多少条线段可以将整个区间完全覆盖 样例: 区间长度8,可选的覆盖线段[2,6],[1,4],[3,6],[3,7],[6,8],[2,4],[3,5] 解题过程: 1将每一个...

2015-03-08 20:09:20

阅读数:308

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭