算法初步
为了acm而刷题
xky1306102chenhong
这个作者很懒,什么都没留下…
展开
-
HDU 1237 简单计算器(后缀式+栈)
简单计算器 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16351 Accepted Submission(s): 5604 Problem Description 读入一个只包含 +, -, *, / 的非负整原创 2016-02-25 11:19:08 · 937 阅读 · 0 评论 -
HDU 1072 Nightmare(BFS)
Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9120 Accepted Submission(s): 4389 Problem Description Ignatius had a night原创 2016-02-20 15:48:07 · 907 阅读 · 0 评论 -
HDU 1026 Ignatius and the Princess I(BFS+记录路径)
1.abduct:绑架,诱拐,使外展 2.原创 2016-01-24 15:15:37 · 1145 阅读 · 1 评论 -
HDU 1016 Prime Ring Problem(DFS)
Prime Ring Problem Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 37427 Accepted Submission(s): 16521 Problem Description A ring is原创 2016-01-21 16:58:45 · 952 阅读 · 0 评论 -
The 12th Zhejiang Provincial Collegiate Programming Contest - D
#include #include using namespace std; long long f[200005]; int vis[200005]; int main() { int t; int n; scanf("%d",&t); while(t--) { scanf("%d",&n); f[0]=0;原创 2015-04-25 22:18:32 · 969 阅读 · 0 评论 -
HDU 1015 Safecracker(第一次用了搜索去遍历超时,第二次用for循环可以了,思路一样的)
Safecracker Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 3 Accepted Submission(s) : 1 Problem Description === Op tech briefing, 2002/11原创 2016-01-20 01:06:15 · 1287 阅读 · 0 评论 -
hdu 5289 Assignment(给一个数组,求有多少个区间,满足区间内的最大值和最小值之差小于k)
1.区间是一段的,不是断开的哟 2.代码是看着标程写的 3.枚举左端点,二分右端点流程: #include #include #include #define LL long long #define Max(a,b) ((a)>(b)?(a):(b)) #define Min(a,b) ((a)<(b)?(a):(b)) using namespace std; cons原创 2015-07-22 12:53:23 · 5174 阅读 · 0 评论 -
用邻接表存储n个顶点m条弧的有向图
例如要存储一下有向图: 当输入6个顶点,8条弧 1 2 1 3 2 4 3 4 3 5 4 1 4 6 5 6 建立的邻接表的流程图为: 实现代码: /* 用邻接表存储n个顶点m条弧的有向图 */ #include #include #define MAX 10005 typedef struct ArcNo原创 2015-06-30 16:41:29 · 2199 阅读 · 2 评论 -
hdu 1358 Period(给定一个字符串,求有多少个前缀(包括自己本身),它是由k(k>2,并且尽量大)个循环节组成的)
代码: #include #include using namespace std; int LCPS[1000005]; int next[1000005]; char s[1000005]; int n; void GetLCPS() { int j=0; int k=-1; next[0]=-1; while(j<n) { if(原创 2015-08-04 11:03:54 · 764 阅读 · 0 评论 -
hdu 1806 Frequent values(给定一个非降序数组,求任意区间内出现次数最多的数的次数)
1.题目解析可见《训练指南》P198 2代码: #include #include #include #define Min(a,b) ((a)<(b)?(a):(b)) #define Max(a,b) ((a)>(b)?(a):(b)) #define N 100005 #define INF 1<<30 using namespace std; int a[N]; int value[原创 2015-08-06 15:51:19 · 1588 阅读 · 0 评论 -
poj 3264 Balanced Lineup(查询区间最大值与最小值的差)
1.代码: #include #include #include #define Max(a,b) ((a)>(b)?(a):(b)) #define Min(a,b) ((a)<(b)?(a):(b)) #define N 100000 int a[N]; int ST1[N][20]; int ST2[N][20]; int n,q; void make_ST() { for(i原创 2015-08-06 16:51:07 · 827 阅读 · 0 评论 -
HDU 1010 Tempter of the Bone(DFS+奇偶剪枝)
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 95890 Accepted Submission(s): 25982 Problem Description The dogg原创 2016-01-12 21:38:12 · 485 阅读 · 0 评论