KLChen的博客

线段上有N个长为1的线段被破坏，请你用K个不限长的stick覆盖他们逆向处理及覆盖完后[nums[1],nums[N]]中间空洞长最大#include<bits/stdc++.h>using namespace std;#define fst first#define sec second#define sci(num) scanf("%d",&num)#defi...

V + 等差求2-(N-1-V)的和#include<bits/stdc++.h>using namespace std;#define fst first#define sec second#define sci(num) scanf("%d",&num)#define scl(num) scanf("%lld",&num)#define mem(a,b...

模拟即可#include <cstdio>#include <bits/stdc++.h>using namespace std;const int MAX_N = 1000100;const int MAX_M = 10010;#define sci(num) scanf("%d",&num)int main() { int x,y,z;...

没想到贪心，好菜。即是n^2枚举从坐标小往前枚举只要不重合就可以#include<cstdio>#include <algorithm>#include <iostream>#include <cstring>#include <queue>#include <set>#include <map>...