- 博客(28)
- 收藏
- 关注
RSS订阅原创 例题25（侏罗纪）（中途相遇法）！
可交题的传送门题解：好题，就是看着书上的讲解也理解了好长时间。在代码中给出详细的解释。代码：#include#include#include#includeusing namespace std;const int maxn=24;maptable;int solo(int x){ return x==0?0:solo(x/2)+(x&1);//求对应的二进
2016-09-28 19:58:35
428
原创 HDU5512（Pagodas）
PagodasTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 983 Accepted Submission(s): 694Problem Descriptionn pagodas were standing
2016-09-28 16:46:14
234
原创 例题20
能交题的传送门题解:把模型建立出来还是很好想的，就是求在某一时刻，被扫到线段的条数个数最多。代码：#include#include#include#include#include#include#includeusing namespace std;struct node{ double x; int type; bool operator <
2016-09-26 19:29:21
241
原创 Codeforces Round #373 (Div. 2) C： Efim and Strange Grade
C. Efim and Strange Gradetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputEfim just received his grade for the l
2016-09-26 17:41:42
247
原创 Codeforces Round #372 (Div. 2)
A. Crazy Computertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder is coding on a crazy computer. I
2016-09-24 14:27:24
273
原创 Codeforces Round #373 (Div. 2)
A. Vitya in the Countrysidetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputEvery summer Vitya comes to visi
2016-09-24 00:43:34
351
原创 2016Hrbust软件学院ACM新生选拔赛（一）
1370: 1.JoJo酱是要成为ACM王的男人！Time Limit: 1 Sec Memory Limit:128 MBSubmit: 5 Solved: 5[Submit][Status][Web Board][Edit] [TestData]Description荣誉，名声，妹纸，曾经拥有世界上一切的“ACM王” asdf，在临死前留下了
2016-09-23 21:02:05
1707
原创 HDU 3709 Balanced Number （数位DP）
Balanced Number Time Limit: 5000MS Memory Limit: 65535KB 64bit IO Format: %I64d & %I64u
2016-09-22 22:53:03
408
原创 HDU5898 odd-even number （数位DP）shenyang网赛
odd-even number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 460 Accepted Submission(s): 247Problem DescriptionFor a numbe
2016-09-20 18:54:01
390
原创 大区间统计素数（最大1e11）
#includeusing namespace std;typedef long long LL;const int N = 5e6 + 2;bool np[N];int prime[N], pi[N];int getprime() { int cnt = 0; np[0] = np[1] = true; pi[0] = pi[1] = 0; fo
2016-09-19 21:25:57
694
原创 CodeForces 55D Beautiful numbers (数位DP）
A - Beautiful numbersCrawling in process... Crawling failed Time Limit:4000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 55D uDebug
2016-09-19 20:45:58
390
原创 初学数位DP
好多比赛都有数位dp，看着别人都能做上来，决心学一下给出 讲解最好的链接：点击打开链接我还是通过两道简单的题目来巩固一下。HDU 2089不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 35150 Ac
2016-09-19 13:35:50
324
原创 HDU5895 Mathematician QSC(经典数论集合题）（一点点更新）
Mathematician QSCTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 142 Accepted Submission(s): 66Problem DescriptionQSC dream of
2016-09-19 10:37:53
704
原创 HDU 5879 Cure（打表）qingdao网赛
CureTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionGiven an integer n, we only
2016-09-17 18:35:51
334
原创 HDU 5878 I Count Two Three（打表）qingdao网赛
I Count Two ThreeTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionI will show
2016-09-17 18:25:27
796
原创 Codeforces Round #371 (Div. 2)
A. Meeting of Old Friendstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday an outstanding event is going to happe
2016-09-14 12:44:37
479
原创 HDU 5875 Function(预处理（线段树））
FunctionTime Limit: 7000/3500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1412 Accepted Submission(s): 521Problem DescriptionThe shorter,
2016-09-13 19:04:57
632
原创 HDU 5875 Function(预处理）
FunctionTime Limit: 7000/3500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1242 Accepted Submission(s): 457 Problem DescriptionThe shorter, the simp
2016-09-12 22:38:50
257
2
原创 Dij+堆优化
struct rec{ int v,w;//终点，花费。};vector edge[N*2];//起点，注意清空struct cmp{ bool operator()(int a,int b) { return dis[a]>dis[b]; }};void add(int x,int y){ edge[x].push_back
2016-09-12 13:19:51
1827
原创 Hrbust 1355 Leyni，罗莉和XianGe （最短路 思维建图，dij优化）
Leyni，罗莉和XianGeTime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 128(23 users)Total Accepted: 31(19 users)Rating: Special Judge: NoDes
2016-09-12 13:12:44
452
原创 HDU 5876Sparse Graph (补图上BFS）
Sparse GraphTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 524 Accepted Submission(s): 172Problem DescriptionIn graph theory,
2016-09-11 11:20:58
420
原创 HDU58739(Football Games)思维
Football GamesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 57 Accepted Submission(s): 19Problem DescriptionA mysterious
2016-09-10 19:42:51
601
原创 Hrbust 1717最大异或值
最大异或值Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 2468(199 users)Total Accepted: 803(160 users)Rating: Special Judge: NoDescription
2016-09-10 10:36:14
540
原创 Codeforces Round #364 (Div. 2)C. They Are Everywhere
C. They Are Everywheretime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSergei B., the young coach of Pokemons,
2016-09-09 21:44:44
230
原创 还是主席树
Source CodeProblem: 2104 User: congrizheng Memory: 22656K Time: 1532MS Language: G++ Result: Accepted •Source Code#include #include #include #include #include #include #include #includ
2016-09-07 13:44:07
352
原创 哈理工OJ 1681“回文串”
回文串Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 107(22 users)Total Accepted: 28(13 users)Rating: Special Judge: NoDescription
2016-09-03 20:44:15
347
原创 SPOJ DQUERY
DescriptionEnglish Vietnamese Given a sequence of n numbers a1, a2, ..., an and a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have to return t
2016-09-03 16:24:06
385
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人