陈健翔

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6638 Problem Description There are n pirate chests buried in Byteland, labeled by 1,2,…,n. The i-th che 阅读全文

摘要： 题目链接：https://www.luogu.org/problem/P4513 阅读全文

摘要： 题目链接：http://www.51nod.com/Challenge/Problem.html#problemId=1157 贪心暴力 阅读全文

摘要： 题目链接：https://ac.nowcoder.com/acm/contest/887/C 题目描述 The Wow village is often hit by wind and sand,the sandstorm seriously hindered the economic develo 阅读全文

摘要： 题目链接：https://www.luogu.org/problem/P1115 线段树求最大子段和 阅读全文

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6601 Problem Description N sticks are arranged in a row, and their lengths are a1,a2,...,aN.There are Q 阅读全文

摘要： 题目链接：https://www.luogu.org/problem/P3834 主席树求静态区间第k小 阅读全文

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6621 Problem Description You have an array: a1, a2, , an and you must answer for some queries.For each 阅读全文

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4417 Problem Description Mario is world-famous plumber. His “burly” figure and amazing jumping ability 阅读全文

摘要： 单个的快速乘取模和快速幂取模时间复杂度都为O(logN)ll mul(ll a,ll b) { ll ans=0; while(b) { if(b&1)ans=(ans+a)%mod; a=(a+a)%mod; b>>=1; } return ans; } ll poww(ll a,ll b) { l... 阅读全文