摘要：
巨水，调了好久，心态爆炸 cpp include include include using namespace std; typedef long long ll; int n, m; const int mod=9999973; ll dp[105][105][105]; inline int 阅读全文
posted @ 2018-01-12 21:41
poorpool
阅读(132)
评论(0)
推荐(0)
摘要：
num[x]表示x到达叶子最远路径。 每个子节点对答案的贡献是num[x] (num[t] + edge[i].val) cpp include include using namespace std; typedef long long ll; int n, ss, hea[500005], cn 阅读全文
posted @ 2018-01-12 20:13
poorpool
阅读(150)
评论(0)
推荐(0)
摘要：
学习位运算 cpp include include using namespace std; int n, m, dp[15][4105], a[15], uu, ans; const int mod=100000000; int main(){ cin m n; for(int i=1; i 阅读全文
posted @ 2018-01-12 19:23
poorpool
阅读(137)
评论(0)
推荐(0)
浙公网安备 33010602011771号