Ostrichcrab的博客

维护前缀和，记录每个字母出现的次数，跑一边即可#include<cstdio>#include<cstring>#include<iostream>using namespace std;const int maxn = 1e5+5;struct point{ int ch[27];} p[maxn];void pre(int n)...

用二进制枚举所有状态，即所有问卷的子集，用map存相同答案问卷出现的次数#include<cstdio>#include<map>#include<cstring>using namespace std;const int maxn = 1009;int a[maxn];char s[11];int main(){ int t,n,...

两次Kruskal，记录最小的、输出，然后每多一条边（不同方案加的边不一定相同，有点坑），分别加在两个答案上，比较最小的输出。。#include<cstdio>#include<algorithm>#include<cstring>#define inf 0x3f3f3f3fusing namespace std;const int N = 10...

。。。 #include<bits/stdc++.h>using namespace std;const int N = 2e5+9;int sum[N];int main(){ // freopen("in.txt","r",stdin); ios::sync_with_stdio(false); int t; int n,m,k; ...

贪心。。 #include<cstdio>#include<algorithm>#include<iostream>#include<cmath>#define ll long longusing namespace std;int main(){ //freopen("in.txt", "r", stdin); ...

最大化最小值，二分答案#include<cstdio>#include<algorithm>#include<iostream>#include<cmath>#define ll long longusing namespace std;const int N = 3e5+9;const int inf = 0x3f3f3f3f;...