PAT顶级
god_speed丶
这个作者很懒,什么都没留下…
展开
-
1004 To Buy or Not to Buy - Hard Version (35分)
1004 To Buy or Not to Buy - Hard Version (35分)Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of bead...原创 2020-03-19 15:37:04 · 438 阅读 · 0 评论 -
1018 Subnumbers(35 分)
前缀和统计 预处理 枚举每个非零位的贡献扫一次就好了#include <bits/stdc++.h>using namespace std;#define MOD (int)(1e9+7)#define ll long long#define db(a) (cout<<"->"<<a<<endl)ll ppow(ll a,ll ...原创 2018-09-07 09:56:17 · 244 阅读 · 0 评论 -
1020 Delete At Most Two Characters(35 分)
DP 先不考虑重复 dp[i][j]表示到i位置已经删了j个的种类数 dp[i][j]=dp[i-1][j]+dp[i-1][j-1] 如果只是这样转移肯定会有重复的。例如一个字符串cdabnaxy,你删除abn和删除bna后得到的字符串都是cdaxy。 这时候就要去重了,根据上面那个栗子可以发现对于一个字符s[i],如果在i之前存在一个x使得s[x]=s[i],那么删除[x,i-1]间...原创 2018-09-07 16:46:07 · 420 阅读 · 0 评论