LeoJAM的博客

首先拆这个方差然后转为斜率优化然后就是水题了。#include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#include<cstring>using namespace std;inline void read(long long &x){...

水题。由于之前存在一个前缀和和大于某个值的条件直接树状数组优化罢了。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;typedef int INT;#define ...

第一次秒掉IOI的题啥？数字三角形？第一，很明显n^3可以过，那不就水了吗？但事实上村庄带权依旧可做而且有朴素的n^2*logn做法甚至整体二分或是决策单调性都可以AC而且复杂度为严格的nlogn所以水过啊#include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#...

计数类DP正难则反求出答案的补集就是动态规划用一个伪前缀和优化就行了#include<bits/stdc++.h>using namespace std;typedef int INT;#define int long longconst int N=1e6+10;int n,m,k;const int mod=1e9+7;int f[N]={};int sum=0;...

定义：S（i）为长度前缀和易得：由于L是常数L++令K为当前最优解则展开定义新函数带回原式转为斜率式完毕#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>...

乍一看不好维护前缀和观察前缀关系：令  有：贡献为 暨拆开：故设： 对于朴素DP、转移有：设k为选中点有：消去相同项不妨设 有完毕#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#inc...