模板
关注
分享
扫一扫
Jogging_Clown
丢掉盔甲，我依然是骄傲帅气的骑士。
展开
-
HDOJ 题目4465 Candy（快速排列组合）
CandyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2238 Accepted Submission(s): 964Special JudgeProblem DescriptionLazyChild is原创 2014-12-12 20:38:42 · 553 阅读 · 0 评论 -
POJ 题目3164 Command Network（最小树形图）
Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 13830 Accepted: 3981DescriptionAfter a long lasting war on words, a war on arms finall原创 2015-03-04 21:47:18 · 529 阅读 · 0 评论 -
POJ 题目2127 Greatest Common Increasing Subsequence（LICS，输出路径）
Greatest Common Increasing SubsequenceTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 9762 Accepted: 2584Case Time Limit: 2000MS Special JudgeDes原创 2015-04-02 18:12:28 · 573 阅读 · 0 评论 -
蓝桥杯 历届试题 高僧斗法 （阶梯nim）
历届试题 高僧斗法 时间限制：1.0s 内存限制：256.0MB 问题描述 古时丧葬活动中经常请高僧做法事。仪式结束后，有时会有“高僧斗法”的趣味节目，以舒缓压抑的气氛。 节目大略步骤为：先用粮食（一般是稻米）在地上“画”出若干级台阶（表示N级浮屠）。又有若干小和尚随机地“站”在某个台阶上。最高一级台阶必须站人，其它任意。(如图1所示原创 2015-03-18 17:46:07 · 1965 阅读 · 0 评论 -
HDOJ 题目1423 Greatest Common Increasing Subsequence（LICS）
Greatest Common Increasing SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4693 Accepted Submission(s): 1496Problem De原创 2015-04-02 17:03:46 · 789 阅读 · 0 评论 -
HDOJ 题目2857 Mirror and Light（关于直线对称点，直线交点）
Mirror and LightTime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem DescriptionThe light travels原创 2015-04-20 17:36:22 · 731 阅读 · 0 评论 -
POJ 题目3694 Network（tarjan，LCA，求桥）
NetworkTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7179 Accepted: 2600DescriptionA network administrator manages a large network. The network cons原创 2015-04-16 21:33:33 · 516 阅读 · 0 评论 -
HDOJ 题目3364 Lanterns（高斯消元，开关灯问题）
LanternsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1174 Accepted Submission(s): 464Problem DescriptionAlice has received a b原创 2015-04-17 22:16:30 · 701 阅读 · 0 评论 -
POJ题目1330 Nearest Common Ancestors（LCA）
Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20488 Accepted: 10785DescriptionA rooted tree is a well-known data structure in co原创 2015-04-16 21:10:10 · 532 阅读 · 0 评论 -
HDOJ 题目3364 Lanterns（高斯消元，开关灯问题）
LanternsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1174 Accepted Submission(s): 464Problem DescriptionAlice has received a b原创 2015-04-17 22:19:18 · 718 阅读 · 0 评论 -
POJ 题目2449 Remmarguts' Date（K短路，A*+spfa）
Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 22824 Accepted: 6228Description"Good man never makes girls wait or breaks an appointment转载 2015-05-03 00:13:45 · 470 阅读 · 0 评论 -
HDOJ 题目2222 Keywords Search（AC自动机）
Keywords SearchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38611 Accepted Submission(s): 12437Problem DescriptionIn the moder原创 2015-03-03 22:55:43 · 610 阅读 · 0 评论 -
HDOJ 题目3062 Party（2-sat）
PartyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4580 Accepted Submission(s): 1508Problem Description有n对夫妻被邀请参加一个聚会，因为场地的问题，每原创 2015-02-28 23:23:29 · 581 阅读 · 0 评论 -
HDOJ 题目1573 X问题（中国剩余定理，拓展欧几里得）
X问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3641 Accepted Submission(s): 1182Problem Description求在小于等于N的正整数中有多少个X满足：X mod原创 2014-12-13 18:20:05 · 1425 阅读 · 0 评论 -
HDOJ 题目3579 Hello Kiki（中国剩余定理，拓展的欧几里得）
Hello KikiTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2270 Accepted Submission(s): 827Problem DescriptionOne day I was shoppi原创 2014-12-13 17:03:11 · 962 阅读 · 0 评论 -
HDOJ 题目1532 Drainage Ditches（最大流）
Drainage DitchesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10289 Accepted Submission(s): 4893Problem DescriptionEvery time i原创 2015-02-05 22:38:23 · 507 阅读 · 0 评论 -
HDOJ 题目1509 Windows Message Queue（priority_queue）
Windows Message QueueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3933 Accepted Submission(s): 1547Problem DescriptionMessage原创 2014-12-14 17:04:40 · 650 阅读 · 0 评论 -
HDOJ 题目4280 Island Transport（最大流，sap）
Island TransportTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5038 Accepted Submission(s): 1636Problem Description In the va原创 2015-02-13 21:47:40 · 509 阅读 · 0 评论 -
HDOJ 题目4738 Caocao's Bridges（双联通，求桥）
Caocao's BridgesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1752 Accepted Submission(s): 642Problem DescriptionCaocao was def原创 2015-02-11 20:39:51 · 544 阅读 · 0 评论 -
HDOJ 题目4607 Park Visit（树的直径）
Park VisitTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2517 Accepted Submission(s): 1134Problem DescriptionClaire and her litt原创 2015-02-11 00:16:24 · 520 阅读 · 0 评论 -
POJ 题目1655 Balancing Act（树的重心）
Balancing ActTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9422 Accepted: 3943DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1.原创 2015-02-27 20:22:13 · 510 阅读 · 0 评论 -
NYOJ 题目178 找规律（Lagrange插值）
找规律时间限制：1000 ms | 内存限制：65535 KB难度：4描述大家一定见过这种题目：给你一些数请找出这些数之间的规律，写出下一个满足该规律的数。比如：2 5 10 17 26，则可以看出这些数符合n*n+1这个通项公式，则下一个数为37。这种通项公式不只一个，所以答案是不唯一的。但如果已知了N个数，且已知其通项公式是一个次数小原创 2015-02-26 21:03:12 · 920 阅读 · 0 评论 -
HDOJ题目2454 Degree Sequence of Graph G（判断是否是简单图）
Degree Sequence of Graph GTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1811 Accepted Submission(s): 750Problem DescriptionWang原创 2015-03-01 22:27:56 · 897 阅读 · 0 评论 -
POJ题目1265 Area（PICK定理）
AreaTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5248 Accepted: 2352DescriptionBeing well known for its highly innovative products, Merck would defin原创 2015-05-03 22:06:09 · 551 阅读 · 0 评论 -
POJ 题目1286 Necklace of Beads（Polya定理）
Necklace of BeadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7061 Accepted: 2942DescriptionBeads of red, blue or green colors are connected together原创 2015-05-04 22:05:43 · 713 阅读 · 0 评论 -
HDOJ 题目4408 Minimum Spanning Tree（Kruskal+Matrix_Tree）
Minimum Spanning TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1408 Accepted Submission(s): 450Problem DescriptionXXX i原创 2015-08-12 20:47:17 · 875 阅读 · 0 评论 -
POJ 题目1659 Frogs' Neighborhood（度数还原无向图）
Frogs' NeighborhoodTime Limit: 5000MS Memory Limit: 10000KTotal Submissions: 8348 Accepted: 3538 Special JudgeDescription未名湖附近共有N个大小湖泊L1, L2, ..., Ln(其中包括未名湖)原创 2015-07-20 18:07:58 · 738 阅读 · 0 评论 -
BZOJ 题目1016: [JSOI2008]最小生成树计数（Kruskal+Matrix_Tree）
1016: [JSOI2008]最小生成树计数原创 2015-08-12 20:38:19 · 901 阅读 · 0 评论 -
POJ 题目3481 Double Queue（SBT ro map）
Double QueueTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11824 Accepted: 5385DescriptionThe new founded Balkan Investment Group Bank (BIG-Bank) opene原创 2015-08-13 21:29:14 · 929 阅读 · 0 评论 -
BZOJ 题目1211: [HNOI2004]树的计数（组合数学，prufer）
1211: [HNOI2004]树的计数Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 1530 Solved: 502[Submit][Status][Discuss]Description一个有n个结点的树，设它的结点分别为v1, v2, …, vn，已知第i个结点vi的度数为di，问满足这样的条件的不同的树有多少棵。给转载 2015-08-14 17:51:07 · 681 阅读 · 0 评论 -
POJ题目3517 And Then There Was One（约瑟夫，公式）
And Then There Was OneTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4918 Accepted: 2623DescriptionLet’s play a stone removing game.Initially, n ston原创 2015-08-14 17:19:17 · 1159 阅读 · 0 评论 -
手写一个节点大小平衡树（SBT）模板，留着用
看了一下午，感觉有了些了解，应该没有错，有错希望斧正，感谢#include#includestruct s{ int key,left,right,size;}tree[10010];int top;void left_rot(int &x)// 左旋{ int y=tree[x].right; tree[x].right=tree[y].left; tree[y].le原创 2015-08-13 19:03:34 · 1557 阅读 · 2 评论 -
POJ 题目2140 K-th Number（划分树）
K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 42155 Accepted: 13855Case Time Limit: 2000MSDescriptionYou are working for Macrohard com原创 2015-08-06 17:31:19 · 594 阅读 · 0 评论 -
AC自动机模板（数组实现版）
BY 九野做了一道题，用我的那种写法华丽丽的超时了，，无奈学一学数组实现的#include#include#include#includeusing namespace std;const int maxnode=250*1000+10000;//maxnode=单词数*单词长度+常数const int sg_size=26;struct Trie{ int ch[ma原创 2015-08-19 15:59:56 · 1347 阅读 · 0 评论 -
HDOJ 题目2512 一卡通大冒险（斯特林第二类数）
一卡通大冒险Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1564 Accepted Submission(s): 1031Problem Description因为长期钻研算法， 无暇顾及个人问题，BUAA原创 2015-02-10 16:28:11 · 783 阅读 · 0 评论 -
POJ 题目2513 Who Gets the Most Candies?（线段树）
Who Gets the Most Candies?Time Limit: 5000MS Memory Limit: 131072KTotal Submissions: 11682 Accepted: 3653Case Time Limit: 2000MSDescriptionN children are si原创 2015-07-30 21:04:01 · 678 阅读 · 0 评论 -
HDOJ 题目3555 Bomb（数位DP）
BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 10419 Accepted Submission(s): 3673Problem DescriptionThe counter-terrori原创 2015-07-29 16:44:37 · 573 阅读 · 0 评论 -
POJ 题目2155 Matrix(二维树状数组)
MatrixTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 20303 Accepted: 7580DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] me原创 2015-05-15 22:30:01 · 823 阅读 · 0 评论 -
百度之星 矩形面积（最小矩形覆盖）
矩形面积 Accepts: 717 Submissions: 1619 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description小度熊有一个桌面，小度熊剪了很多矩形放在桌面上，小度熊想知道原创 2015-05-30 20:47:44 · 1505 阅读 · 0 评论 -
优化gcd
int gcd(int x,int y ) 2{ 3 if(x return gcd(y,x); // x>y 4 if( y == 0) return x; // if y=0, x is GCD 5 else 6 { 7 if( !(x%2) ) 8 { 9转载 2015-07-25 16:17:32 · 682 阅读 · 0 评论