![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
差分
Hacheylight
ZJ OIer
展开
-
Codeforces 1091E New Year and the Acquaintance Estimation 题解
Codeforces 1091E New Year and the Acquaintance Estimation 【题意】 给你nnn个点的度(d1,d2,...,dn)(d_1,d_2,...,d_n)(d1,d2,...,dn),然后问你第n+1n+1n+1个点的度(dn+1)(d_{n+1})(dn+1)的所有可能值 附上鄂尔多斯定理:∑i=1kdi≤k(k−1)+∑i=k+1nm...原创 2019-01-01 10:49:23 · 385 阅读 · 0 评论 -
codeforces 191C Fools and Roads (树链剖分 或 树上差分) HQG_AC 的博客
#include <bits/stdc++.h> using namespace std ; const int N = 100000 + 10 ; struct node{ int v,next,en ; }e[2*N]; int cf[N] ; int ans[N] ; bool vis[N] ; int tot,a,b,n,u,v,k ; int head[N],deep...原创 2018-04-28 22:07:24 · 222 阅读 · 0 评论