LSD20164388的博客

如果你过几天就忘了,那么你并没有真正的掌握。

HDU 3486 Interviewe(枚举+RMQ)

Interviewe Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8822    Accepted Submission(s): ...

2019-02-17 20:54:01

阅读数 70

评论数 0

HDU 5726 GCD(RMQ+二分)

GCD Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 5303    Accepted Submission(s): 1909  ...

2018-08-16 09:55:40

阅读数 47

评论数 0

HDU 6393 Traffic Network in Numazu(LCA+思维+(树上差分)树状数组)

Traffic Network in Numazu Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 239    Accepted...

2018-08-14 10:10:35

阅读数 73

评论数 0

HDU 6356 Glad You Came(倍增)

Glad You Came Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1844    Accepted Submissio...

2018-08-08 09:20:40

阅读数 46

评论数 0

HDU 5296 Annoying problem(LCA+DFS序+思维)

Annoying problem Time Limit: 16000/8000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1906    Accepted Submissi...

2018-07-18 13:15:32

阅读数 76

评论数 0

2018年3月7日训练日记

RMQ问题中的ST算法:(摘自某位大佬)ST(Sparse Table)算法定义:f[i][j]表示i到i+2^j-1这段区间的最大值。预处理:f[i][0]=a[i]。即i到i区间的最大值就是a[i]。状态转移:将f[i][j]平均分成两段,一段为f[i][j-1],另一段为f[i+2^(j-1...

2018-03-07 21:13:26

阅读数 115

评论数 0

提示
确定要删除当前文章?
取消 删除
关闭
关闭