![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM&算法
nzq1234
这个作者很懒,什么都没留下…
展开
-
HDU 2147 bash博弈
思路正确,但超时超时代码:#include using namespace std;int map[2001][2001];int NOok(int x,int y){ if(map[x-1][y] && map[x][y-1] && map[x-1][y-1])//只能向上、左、上左走。三方向同时为N则当前点必为P return 1; return原创 2013-04-24 12:23:49 · 441 阅读 · 0 评论 -
HDU 1690 Bus System
Bus SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4254 Accepted Submission(s): 1074Problem DescriptionBecause of the huge原创 2012-09-08 20:51:01 · 308 阅读 · 0 评论 -
HDU 1596 find the safest road
find the safest roadTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3577 Accepted Submission(s): 1377Problem DescriptionXX星球有很多城原创 2012-09-08 20:59:52 · 286 阅读 · 0 评论 -
HDU 1233 还是畅通工程
还是畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15325 Accepted Submission(s): 6975Problem Description某省调查乡村交通状况,得到的统计表中列出了任原创 2012-09-08 21:04:50 · 252 阅读 · 0 评论 -
HDU 2066 一个人的旅行
#includeusing namespace std;const int INF=0x3fffffff;int map[1010][1010];int used[1010];int dis[1010];void init(){ int i,j; for(i=0;i<=1000;i++) { dis[i]=IN原创 2012-09-08 20:32:46 · 294 阅读 · 0 评论 -
HDU 2544 最短路
最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15743 Accepted Submission(s): 6686Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件原创 2012-09-08 20:16:48 · 471 阅读 · 0 评论 -
HDU 1856 More is better
题目理解:输入n组数,每组数包括两个数,表示这两个数有关系。输入n组数后,有关系的数就构成一棵树。题目要求找出最大树的节点个数。思路:用并查集。把每棵数看作一个集合,把每个节点指向同一个父节点。最后统计以某节点为父节点的集合中有几个元素,输出最大集合的元素个数。 #includeusing namespace std;long father[100010];long原创 2012-09-08 20:07:10 · 192 阅读 · 0 评论 -
HDU 1162 Eddy's picture Kruskal算法
Eddy's pictureTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4361 Accepted Submission(s): 2151Problem DescriptionEddy begins to原创 2012-09-08 21:15:40 · 790 阅读 · 0 评论 -
HDU 4031 Attack
#include#includeusing namespace std;struct att{ int l,r;}a[20011];int c[20011];int denf[20011];int pos[20011];//墙的解冻时间点int n;int lowbit(int x){ return x & (-x);}void update(int原创 2013-04-02 11:45:37 · 395 阅读 · 0 评论 -
字典树
#include#include #include #include#include#include#include#includeusing namespace std;struct Node{ struct Node *child[26]; char res[32]; bool flag;}root;void init(原创 2013-04-13 15:02:47 · 363 阅读 · 0 评论 -
unfinished
#include#include #include #include#include#include#include#includeusing namespace std;struct Node{struct Node *child[10];}root;struct Node *start;void init(struct Node原创 2013-04-13 16:55:56 · 454 阅读 · 0 评论 -
HDU1754
#include#includeusing namespace std;int arry[200001];//初始数值const int MaxNum=200010;struct Tree //线段树的区间结点{ int L,R; //某结点的区间范围 int Max; //区间最值}tree[4*MaxNum];void B原创 2013-04-17 11:15:15 · 367 阅读 · 0 评论 -
HDU 1874 畅通工程续
畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14421 Accepted Submission(s): 4910Problem Description某省自从实行了很多年的畅通工程计划后,终于修建原创 2012-09-08 20:38:55 · 372 阅读 · 0 评论