摘要:
前言 ~~多项式求逆还是爽的一批~~ Solution 考虑分治求解这个问题。 直接每一次NTT一下就好了。 代码实现 cpp include include include include include include include using namespace std; define ll 阅读全文
摘要:
前言 其实我是不小心翻线性基的时候看见的。 Solution 左偏树只会模板,挖坑待补 代码实现 cpp include include include include include include include include include using namespace std; defi 阅读全文
摘要:
前言 线段树菜鸡报告,stO "ZCDHJ" Orz,GSS基本上都切完了。 Solution 考虑一下用线段树维护一段区间左边连续的Max,右边的连续Max,中间的连续Max还有总和,发现这些东西可以相互合并,然后直接写就好了。 cpp include include include includ 阅读全文