2013年7月24日

RMQ 模板

摘要： 一维模板const int maxn=50001; class CRMQ { private: int Max[20][maxn]; int Min[20][maxn]; int idx[maxn]; public: int val[maxn]; void initRMQ(int n) { idx[0]=-1; for (int i=1; i>1)]); Max[i][j]=max(Max[i-1][j],Max[i-1][j+(1>1)]); ... 阅读全文

posted @ 2013-07-24 16:22 电子幼体 阅读(131) 评论(0) 推荐(0) 编辑

poj 2449 k短路--模板

摘要： Remmarguts' DateTime Limit:4000MSMemory Limit:65536KTotal Submissions:17853Accepted:4879Description"Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head, he told them a story."Prince Remmarguts lives i 阅读全文

posted @ 2013-07-24 15:08 电子幼体 阅读(122) 评论(0) 推荐(0) 编辑

MUTC2013 E-Deque-hdu 4604

摘要： DequeTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 786Accepted Submission(s): 253Problem DescriptionToday, the teacher gave Alice extra homework for the girl weren't attentive in his class. It's hard, and Alice is going to turn to you for 阅读全文

posted @ 2013-07-24 14:37 电子幼体 阅读(159) 评论(0) 推荐(0) 编辑

MUTC7 C - Dragon Ball 单调队列dp

摘要： Dragon BallTime Limit: 3000/1500 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1680Accepted Submission(s): 614Problem DescriptionSean has got a Treasure map which shows when and where the dragon balls will appear. some dragon balls will appear in a line at the same ti 阅读全文

posted @ 2013-07-24 11:52 电子幼体 阅读(162) 评论(0) 推荐(0) 编辑

MUTC7 A-As long as Binbin loves Sangsang

摘要： As long as Binbin loves SangsangTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2053Accepted Submission(s): 501Problem DescriptionBinbin misses Sangsang so much. He wants to meet with Sangsang as soon as possible.Now Binbin downloads a map from ELG 阅读全文

posted @ 2013-07-24 10:43 电子幼体 阅读(193) 评论(0) 推荐(0) 编辑

导航