摘要：
我太弱了。。。 单调队列优化DP+二分答案。 cpp include include include include include include include include include include include include define fo(i,j,k) for(int i= 阅读全文
摘要：
各种模板的集合。 1.手写堆 阅读全文
摘要：
背包。 cpp include include include include include include include include include include include include define fo(i,j,k) for(int i(j);i=k;i ) define g 阅读全文
摘要：
预处理出来所有的双平方数，然后枚举地一个和第二个数。 中间要加一个剪枝。因为知道了首项和公差和项数就能求出最后一项是不是可行的了。 阅读全文