YDDDD

2019年10月3日

Codeforces Round #589 (Div. 2) B. Filling the Grid

摘要：链接: https://codeforces.com/contest/1228/problem/B 题意: Suppose there is a h×w grid consisting of empty or full cells. Let's make some definitions: ri i 阅读全文

posted @ 2019-10-03 13:09 YDDDD 阅读(233) 评论(0) 推荐(0)

Codeforces Round #589 (Div. 2) A. Distinct Digits

摘要：链接: https://codeforces.com/contest/1228/problem/A 题意: You have two integers l and r. Find an integer x which satisfies the conditions below: l≤x≤r. Al 阅读全文

posted @ 2019-10-03 12:37 YDDDD 阅读(171) 评论(0) 推荐(0)

Codeforces Round #590 (Div. 3) E. Special Permutations

摘要：链接: https://codeforces.com/contest/1234/problem/E 题意: Let's define pi(n) as the following permutation: [i,1,2,…,i−1,i+1,…,n]. This means that the i th 阅读全文

posted @ 2019-10-03 12:25 YDDDD 阅读(415) 评论(0) 推荐(0)

Codeforces Round #590 (Div. 3) D. Distinct Characters Queries(线段树, 位运算)

摘要：链接: https://codeforces.com/contest/1234/problem/D 题意: You are given a string s consisting of lowercase Latin letters and q queries for this string. Re 阅读全文

posted @ 2019-10-03 00:21 YDDDD 阅读(402) 评论(0) 推荐(0)

2019年10月2日

Codeforces Round #590 (Div. 3) C. Pipes

摘要：链接: https://codeforces.com/contest/1234/problem/C 题意: You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top 阅读全文

posted @ 2019-10-02 23:49 YDDDD 阅读(483) 评论(3) 推荐(0)

Codeforces Round #590 (Div. 3) B2. Social Network (hard version)

摘要：链接: https://codeforces.com/contest/1234/problem/B2 题意: The only difference between easy and hard versions are constraints on n and k. You are messagin 阅读全文

posted @ 2019-10-02 21:10 YDDDD 阅读(389) 评论(0) 推荐(0)

Codeforces Round #590 (Div. 3) A. Equalize Prices Again

摘要：链接: https://codeforces.com/contest/1234/problem/A 题意: You are both a shop keeper and a shop assistant at a small nearby shop. You have n goods, the i 阅读全文

posted @ 2019-10-02 20:58 YDDDD 阅读(483) 评论(0) 推荐(0)

Acwing-287-积蓄程度(树上DP, 换根)

摘要：链接: https://www.acwing.com/problem/content/289/ 题意: 有一个树形的水系，由 N 1 条河道和 N 个交叉点组成。我们可以把交叉点看作树中的节点，编号为 1~N，河道则看作树中的无向边。每条河道都有一个容量，连接 x 与 y 的河道的容量记为 c( 阅读全文

posted @ 2019-10-02 19:23 YDDDD 阅读(151) 评论(0) 推荐(0)

Acwing-286-选课(树上DP)

摘要：链接: https://www.acwing.com/problem/content/288/ 题意: 学校实行学分制。每门的必修课都有固定的学分，同时还必须获得相应的选修课程学分。学校开设了 N 门的选修课程，每个学生可选课程的数量 M 是给定的。学生选修了这 M 门课并考核通过就能获得相应阅读全文

posted @ 2019-10-02 11:41 YDDDD 阅读(183) 评论(0) 推荐(0)

2019年9月29日

洛谷-P3796-AC自动机加强版

摘要：链接: https://www.luogu.org/problem/P3796 题意: 有NN个由小写字母组成的模式串以及一个文本串TT。每个模式串可能会在文本串中出现多次。你需要找出哪些模式串在文本串TT中出现的次数最多。思路: 字典树的每个结束节点记录对应的模板串标号, 匹配时记录次数. 代码阅读全文

posted @ 2019-09-29 22:57 YDDDD 阅读(150) 评论(0) 推荐(0)

精神病患者

公告