qq_51737737的博客

D. Range and Partition题意：给你一个长为n的数组，让你分成k段，满足每段在[x,y]内的严格大于在在[x,y]外的，请你最小化y − x并输出切割方案。思路：若有cnt1个数在[x,y]内 cnt2个数在[x,y]外 则整个区间一定能分成cnt1-cnt2段（类似中位数分段：传送门）cnt1+cnt2=n , cnt1-cnt2=k 则cnt1=(n+k+1)/2可以用双指针求出 [x,y] 内有cnt1个数的最小区间//#pragma GCC optimize(2)

DZY Loves Sequencesb[i] 为 i 开始上升序列的右边界。//#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#define pb push_back#define pii pair<int,int>#defi.

Perform Easily//#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#define pb push_back#define pii pair<int,int>#define IOS ios::sync_with_stdio

都说小镇的切糕贵思路：尺取法，双指针//#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#define pb push_back#define pii pair<int,int>#define IOS ios::sync_with_