比赛
神奇的dp
http://172.16.0.132/senior/#contest/show/2248/0
cdq分治√
http://172.16.0.132/senior/#contest/show/2248/2
cdq分治,按照时间来搞。
每次从左和从右各扫一遍
(树状数组写得像shit一样)
模拟?
http://172.16.0.132/senior/#contest/show/2243/1
Dp+线段树+斜率优化
http://172.16.0.132/senior/#contest/show/2216/3
网络流
http://172.16.0.132/senior/#contest/show/2226/1
网络流+1√
http://172.16.0.132/senior/#contest/show/2250/2
按照源点->前缀流量1,前缀->相应后缀流量+∞,后缀->汇点流量1建图
求最小割
如果源点可以通过残余网络到某个后缀,那么该后缀对应边一定被切掉,所以该后缀要选
前缀反之
相同题:http://172.16.0.132/senior/#contest/show/2290/1
burnside引理
http://172.16.0.132/senior/#contest/show/2253/0
斜率优化(瞎写过了一脸懵逼)
http://172.16.0.132/senior/#contest/show/2259/2
字符串瞎搞
http://172.16.0.132/senior/#contest/show/2288/2
LCT?
似乎可以分块做
好像是点分治
http://172.16.0.132/senior/#contest/show/2288/3