Codeforces Round #273 (Div. 2)D. Red-Green Towers
题目链接01背包计算方案数#include<bits/stdc++.h>using namespace std;typedef long long ll; const int N=2e5+100,mod=1e9+7;void add(ll &a,ll b){ a=(a+b+mod)%mod; }int main(){ ll h,s,g,r,dp[N],an...
原创
2019-07-09 09:41:51 ·
277 阅读 ·
0 评论