Fighting_sh - 博客园

Most Distant Point from the Sea

摘要： Most Distant Point from the Sea http://poj.org/problem?id=3525 Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 6214 Accepted: 2745 Special 阅读全文

posted @ 2019-05-05 21:34 Fighting_sh 阅读(257) 评论(0) 推荐(0)

Art Gallery

摘要： Art Gallery http://poj.org/problem?id=1279 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9684 Accepted: 3747 Description The art gallerie 阅读全文

posted @ 2019-05-05 18:27 Fighting_sh 阅读(609) 评论(0) 推荐(0)

Rotating Scoreboard（半平面交模板题）

摘要： Rotating Scoreboard http://poj.org/problem?id=3335 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 8506 Accepted: 3357 Description This yea 阅读全文

posted @ 2019-05-03 13:01 Fighting_sh 阅读(360) 评论(0) 推荐(0)

Harry Potter and J.K.Rowling(半平面交+圆和矩形交)

摘要： Harry Potter and J.K.Rowling http://acm.hdu.edu.cn/showproblem.php?pid=3982 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/O 阅读全文

posted @ 2019-04-27 22:53 Fighting_sh 阅读(340) 评论(0) 推荐(0)

Max answer（单调栈+ST表）

摘要： Max answer https://nanti.jisuanke.com/t/38228 Alice has a magic array. She suggests that the value of a interval is equal to the sum of the values in 阅读全文

posted @ 2019-04-23 13:45 Fighting_sh 阅读(372) 评论(0) 推荐(0)

P3865 【模板】ST表

摘要： P3865 【模板】ST表 https://www.luogu.org/problemnew/show/P3865 题目背景这是一道ST表经典题——静态区间最大值请注意最大数据时限只有0.8s，数据强度不低，请务必保证你的每次查询复杂度为 O(1)O(1) 题目描述给定一个长度为 NN 的数列阅读全文

posted @ 2019-04-22 21:41 Fighting_sh 阅读(175) 评论(0) 推荐(0)

Distance on the tree

摘要： Distance on the tree https://nanti.jisuanke.com/t/38229 DSM(Data Structure Master) once learned about tree when he was preparing for NOIP(National Oly 阅读全文

posted @ 2019-04-22 20:00 Fighting_sh 阅读(284) 评论(0) 推荐(0)

GCD（欧拉函数）

摘要： GCD http://acm.hdu.edu.cn/showproblem.php?pid=2588 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s) 阅读全文

posted @ 2019-04-17 23:06 Fighting_sh 阅读(468) 评论(0) 推荐(0)

有趣的数学题

摘要： http://csustacm.com:4803/problem/1106 1 #include<bits/stdc++.h> 2 using namespace std; 3 #define lson l,mid,rt<<1 4 #define rson mid+1,r,rt<<1|1 5 #de 阅读全文

posted @ 2019-04-16 16:45 Fighting_sh 阅读(256) 评论(0) 推荐(0)

Educational Codeforces Round 43 (Rated for Div. 2)

摘要： Educational Codeforces Round 43 (Rated for Div. 2) https://codeforces.com/contest/976 A 1 #include<bits/stdc++.h> 2 using namespace std; 3 #define lso 阅读全文

posted @ 2019-04-01 21:51 Fighting_sh 阅读(199) 评论(0) 推荐(0)