摘要:
树状数组 + 倍增 动态维护第k大 注意倍增是 include include include include using namespace std; const int MAXN = 100005; int n, c[MAXN], lg[MAXN], po[MAXN], sum, ans, nu 阅读全文
摘要:
树形分组背包 注意顺序 cpp include include include include include include using namespace std; const int MAXN = 305; vector g[MAXN]; int dp[MAXN][MAXN], num[MAX 阅读全文
摘要:
树型DP 一个人不能和他的直接上司一起去,那么就分别保存这个人去和不去的最大值 注意转移方程 cpp include include include include using namespace std; const int MAXN = 7005; int n, num[MAXN], dp[MA 阅读全文