- 博客(18)
- 资源 (3)
- 收藏
- 关注
原创 UVA 658 It's not a Bug, it's a Feature! 隐式图搜索
It's not a Bug, it's a Feature!DescriptionDownload as PDFIt is a curious fact that consumers buying a new software product generally do not expect the software to be bug-free. Can you imagine buying a car whose steering wheel only turns to the right? O
2015-07-30 10:18:46 530
原创 hdu 5316 Magician
Problem DescriptionFantasy magicians usually gain their ability through one of three usual methods: possessing it as an innate talent, gaining it through study and practice, or receiving it from another being, often a god, spirit, or demon of some sort. S
2015-07-29 20:11:11 564
原创 hdu 5325 Crazy Bobo (拓扑排序代替树的遍历解决爆栈)
Crazy BoboTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 554 Accepted Submission(s): 168Problem DescriptionBobo has a tre
2015-07-29 08:43:54 585
原创 hdu 5326 Work
WorkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem Description It’s an interesting
2015-07-28 16:51:14 476
原创 hdu 5319 Painter (此题纪念不仔细读题而逝去的WA)
PainterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionMr. Hdu is an painter,
2015-07-28 16:31:33 459
原创 UVA 10048
题意:给出一张n个点,m条带正权的双向边,现在有q次询问,每次询问要你求出给出的两个点间最小的可行路中最大边权值(有点绕);分析:数据较小,直接Floyd,对于每次dp,两点间要么是原来的权短,要么是另外两条路的最大边权短,那么有 g[j][k]=g[k][j]=min(g[j][k],max(g[i][j],g[i][k]));暴力跑过。#include#include#in
2015-07-27 18:49:05 455
原创 SPFA算法模板
int spfa(int s,int t){ int d[maxn]; int vis[maxn]; memset(vis,0,sizeof vis); queueque; que.push(s); vis[s]=1; for(int i=1; i<=20; i++) d[i]=INF; d[s]=0; while(qu
2015-07-27 16:21:57 318
原创 POJ 2481 Cows
DescriptionFarmer John's cows have discovered that the clover growing along the ridge of the hill (which we can think of as a one-dimensional number line) in his field is particularly good
2015-07-27 08:40:03 396
原创 C. Watto and Mechanism
time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWatto, the owner of a spare parts store, has recently got an order for the
2015-07-25 21:15:30 685
转载 最大流dinic 模板
//http://blog.csdn.net/u012965890/article/details/38238923void dinic_bfs(int s){ int f,r; memset(lv,-1,sizeof lv); q[f=r=0]=s; lv[s]=0; while(f<=r) { int k=q[f+
2015-07-25 21:05:59 508
原创 hdu 5294 Tricks Device
Tricks DeviceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1762 Accepted Submission(s): 458Problem DescriptionInnocent Wu
2015-07-25 18:55:46 415
原创 hdu 5299 Circles Game
Circles GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 547 Accepted Submission(s): 150Problem DescriptionThere are n
2015-07-22 20:59:55 873
原创 hdu 5289 Assignment
AssignmentTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1317 Accepted Submission(s): 642Problem DescriptionTom owns a com
2015-07-22 20:46:39 424
原创 hdu 5292 Pocket Cube
Pocket Cube Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 92 Accepted Submiss
2015-07-22 20:02:36 515
原创 Sticks(Central Europe 1995)
DescriptionGeorge took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sti
2015-07-09 21:04:23 1350
原创 Eight(South Central USA 1998)
DescriptionThe 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it,
2015-07-09 20:50:16 1218
原创 LightOJ - 1259 Goldbach`s Conjecture
DescriptionGoldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:Every even integer, greater than 2, can be expressed as the sum of t
2015-07-09 20:36:21 705
原创 ACM POJ 1328 Radar Installation
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each s
2015-07-09 19:30:50 420
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人