随笔分类 - 预处理---离散化
摘要:题目:https://www.luogu.org/problemnew/show/P1052 题意: 青蛙要从0跳到超过l的地方,每一次可以跳s到t之间的任意数。 在河中有m个石头,要求在尽量不要跳到石头的情况下,青蛙最少可能会跳到多少颗石头。 思路: 刚开始很自然的想到就是用dp[i]
阅读全文
摘要:题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805344776077312 题意: 有m对朋友关系,每个人用4为数字的编号表示,如果是负数表示这是女生。 给定k个查询,对于要查的人a和b,问有多少对朋友(c,d)使
阅读全文
摘要:Cow Relays Time Limit: 1000MS Memory Limit: 65536K Total Submissions:9207 Accepted: 3604 Description For their physical fitness program, N (2 ≤ N ≤ 1,
阅读全文
摘要:The Battle of Chibi Time Limit: 6000/4000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2899 Accepted Submission(s):
阅读全文
摘要:Making the Grade Time Limit: 1000MS Memory Limit: 65536K Total Submissions:10187 Accepted: 4724 Description A straight dirt road connects two fields o
阅读全文
摘要:There's a beach in the first quadrant. And from time to time, there are sea waves. A wave ( xx , yy ) means the wave is a rectangle whose vertexes are
阅读全文
摘要:The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all pl
阅读全文