随笔分类 -  acm

二分查找 http://ac.jobdu.com/problem.php?pid=1545
摘要：#include#include#include#include#include#include#includeusing namespace std; const int MaxInt = 0x7fffffff;const int Max = 100010; struct Node{ int next; int value; bool flag; Node():next(0), value(0), flag(false) { } Node(int nxt, int val): next(nxt), value(val), flag(false) { }};vec... 阅读全文
posted @ 2013-10-09 21:44 forgood 阅读(389) 评论(0) 推荐(0)
二叉树应用
摘要：http://ac.jobdu.com/problemstatus.php?pid=1543#include#include#include#includeusing namespace std;//#define llu dtypedef unsigned long long lld;const int Max = 1000;int path[Max];void getP_Q(lld n, lld &p, lld &q){ int cnt = 0; lld tmp; while (n != 1) { tmp = n>>1; if (n ==... 阅读全文
posted @ 2013-10-07 23:23 forgood 阅读(156) 评论(0) 推荐(0)
线段树入门
摘要：http://ac.jobdu.com/problem.php?pid=1544#include #include #include #include const int Maxint = 0x7fffffff;const int Max = 200010;int node[Max];int data[Max];void createSegTree(int L, int R, int root){ if (L == R) { node[root] = data[L]; return ; } int mid = (L + R) / 2; createSegTree(L, mid, root .. 阅读全文
posted @ 2013-10-07 14:19 forgood 阅读(160) 评论(0) 推荐(0)
hdu 1072 Nightmare （广搜）
摘要：Problem Descriptionhttp://acm.hdu.edu.cn/showproblem.php?pid=1072Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb explodes. The initial exploding time of the bomb is set t 阅读全文
posted @ 2012-04-17 00:53 forgood 阅读(173) 评论(0) 推荐(0)
飞越原野 （经典广搜）
摘要：飞越原野Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 60 Accepted Submission(s) : 16Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description勇敢的法里奥出色的完成了任务之后，正在迅速地向自己的基地撤退。但由于后面有着一大群追兵，所以法里奥要尽快地返回基地，否则就会被敌人逮住。 终于，法里奥来到了最后的一站；泰拉希尔草原，. 阅读全文
posted @ 2012-04-15 23:37 forgood 阅读(756) 评论(0) 推荐(0)
学习计划
摘要：初期:一.基本算法: (1)枚举. (poj1753{bfs+位二进制} ,poj2965{bfs 或者一种很巧妙的解法} ) (2)贪心(poj1328,poj2109,poj2586) (3)递归和分治法. (4)递推. (5)构造法.(poj3295) (6)模拟法.(poj1068,poj2632,poj1573,poj2993,poj2996)二.图算法: (1)图的深度优先遍历和广度优先遍历. (2)最短路径算法(dijkstra,bellman-ford,floyd,heap+dijkstra)(poj1860,poj3259,poj1062,poj2253,poj1125,p. 阅读全文
posted @ 2011-12-02 11:03 forgood 阅读(178) 评论(0) 推荐(0)