计数DP
文章平均质量分 50
ddd
西伯利亚松鼠
退役ACMer,退役MOer
展开
-
Ignatius and the Princess IV HDU - 1029 计数DP
Ignatius and the Princess IV code /*SiberianSquirrel*//*CuteKiloFish*/ #include <bits/stdc++.h> using namespace std; using ll = long long; using ill = __int128; using pii = pair<int, int>; using pll = pair<ll, ll>; const ll MOD = ll(1e8原创 2021-05-22 13:31:32 · 684 阅读 · 0 评论 -
Max Sum Plus Plus HDU - 1024 计数DP
Max Sum Plus Plus code /*SiberianSquirrel*//*CuteKiloFish*/ #include <bits/stdc++.h> using namespace std; using ll = long long; using ill = __int128; using pii = pair<int, int>; using pll = pair<ll, ll>; const ll MOD = ll(1e8 + 7); const原创 2021-05-22 13:30:02 · 744 阅读 · 0 评论 -
被3整除的子序列 牛客 计数DP
被3整除的子序列 solution dp[i][j%3]=dp[i−1][(j−a[i])%3]+dp[i−1][j%3]dp[i][j\%3]=dp[i-1][(j-a[i])\%3]+dp[i-1][j\%3]dp[i][j%3]=dp[i−1][(j−a[i])%3]+dp[i−1][j%3] dp[i][a[i]%3]++dp[i][a[i]\%3]++dp[i][a[i]%3]++ code /*SiberianSquirrel*//*CuteKiloFish*/ #include <bi原创 2021-05-21 11:14:56 · 744 阅读 · 0 评论 -
666RGB 牛客练习赛41 计数DP
666RGB solution 两个操作:两个操作:两个操作: j=−j=>temp+j=temp−jj = -j=>temp+j=temp-jj=−j=>temp+j=temp−j j=j+a[i]=>temp+j=temp+j+a[i]j = j + a[i]=>temp+j=temp+j+a[i]j=j+a[i]=>temp+j=temp+j+a[i] dp[i][2∗temp−j]+=dp[i−1][j]dp[i][2*temp-j]+=dp[i-1][j]dp原创 2021-05-21 11:09:23 · 723 阅读 · 0 评论