![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
CF
hqwhqwhq
有梦想就不累
展开
-
CodeForces #553 E&F
E. Number of Components 解法: dp[i]dp[i]dp[i] 维护从节点111到iii为止的∑∑f(l,r)\sum\sum f(l,r)∑∑f(l,r)值。 那么有dpdpdp转移方程: dp[i]={dp[i−1]+(val[i]−val[i−1])∗(n−val[i]+1)if val[i]>val[i−1]dp[i−1]+(val[i−...原创 2019-04-23 23:46:13 · 156 阅读 · 0 评论 -
Codeforces Round #585 (Div. 2) F. Radio Stations
题意 2−SAT2-SAT2−SAT多了一个边的范围,其实只需要把点的范围加上去就行了即: 第iii个点(l[i],r[i])(l[i], r[i])(l[i],r[i]),那么构造点jjj,kkk对应l[i]l[i]l[i],r[i]+1r[i]+1r[i]+1。 j<<1j<<1j<<1,j<<1∣1j<<1|1j<<1∣...原创 2019-10-05 22:20:28 · 179 阅读 · 0 评论