摘要：
#include#include#include#include#includeusing namespace std;#define ll long long#define maxn 100000int n;ll l;ll c[maxn];ll X[maxn],Y[maxn];ll f[maxn];int bo,he,qu[maxn];int main(){ scanf("%d%lld",&n,&l); for(int i=1;ibo&&(Y[qu[bo+1]]-Y[qu[bo]])bo&&(double)(Y[qu[he] 阅读全文
摘要：
预处理的d[i][j]为第i块到第j点的答案块外的暴力#include#include#include#include#include#includeusing namespace std;#define maxn 100100#define maxs 320int S,T;int n,m,c;vector col[maxn];int a[maxn];int le[maxs],ri[maxs];int d[maxs][maxn];int rec,cas;int op[maxs],cc[maxn];int lab[maxn],num;int ask(int x,int y){ int mi... 阅读全文