提高！！！

1.盖楼

二分

#include <iostream>

using namespace std;

const int INF = 2e9;
using LL = long long;

int n, m, x, y;

bool ok(LL h) {
  LL a = h / x;
  LL b = h / y;
  LL c = h / x / y;

  LL p = max(0LL, n - (b - c));
  LL q = max(0LL, m - (a - c));

  return p + q <= h - a - b + c;
}

int main() {
  cin >> n >> m >> x >> y;

  int l = 1, r = INF;
  while (l < r) {
    LL mid = (LL)l + r >> 1;
    if (ok(mid)) r = mid;
    else l = mid + 1;
  }
  cout << l << endl;

  return 0;
}

2.【深基18.例3】查找文献(vector)

输入：

8 9
1 2
1 3
1 4
2 5
2 6
3 7
4 7
4 8
7 8

vector写法：c++常用知识，vector

本人写的，WA了

#include<stdio.h>
#include<math.h>
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
vector <int> e[N];
bool vis[N]={0}; //标记数组
struct er {
	int u,v;
} s[N];
bool fun(er x,er y) {
	if(x.u==y.u)
		return x.v<y.v;
	else return x.v<y.v;
}
void dfs(int x) { //深度优先遍历
	vis[x]=1;
	cout<<x<<" ";
	for(int i=0; i<e[x].size(); i++) {
		int point=s[e[x][i]].v;
		if(!vis[point]) {
			dfs(point);
		}
	}
}
void bfs(int x) { //广度优先遍历
	queue <int> q;
	q.push(x);
	cout<<x<<" ";
	vis[x]=1;
	while(!q.empty()) {
		int fro=q.front();
		for(int i=0; i<e[fro].size(); i++) {
			int point=s[e[fro][i]].v;
			if(!vis[point]) {
				q.push(point);
				cout<<point<<" ";
				vis[point]=1;
			}
		}
		q.pop();
	}
}
int n,m;
int main() {
	cin>>n>>m;
	for(int i=0; i<m; i++) {
		cin>>s[i].u>>s[i].v;
	}
	sort(s+1,s+1+n,fun);
	for(int i=0; i<m; i++)
		e[s[i].u].push_back(i);
	dfs(1);   //从1号顶点开始深搜
	cout<<endl;
	memset(vis,0,sizeof(vis));
	bfs(1);   //广搜亦同理
//	for(int i=0; i<m; i++)
//		printf("%d %d\n",s[i].u,s[i].v);
	return 0;
}

AC：

#include<iostream>  //头文件头文件头文件
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;  
struct edge{       //存边结构体
	int u,v;
}; 
vector <int> e[100001];  //两个vector刚才已经详细讲过了
vector <edge> s;
bool vis1[100001]={0},vis2[100001]={0}; //标记数组
bool cmp(edge x,edge y){  //排序规则
	if(x.v==y.v)
	return x.u<y.u;
	else return x.v<y.v;
}
void dfs(int x){  //深度优先遍历
	vis1[x]=1;
	cout<<x<<" ";
	for(int i=0;i<e[x].size();i++){
		int point=s[e[x][i]].v;
		if(!vis1[point]){
			dfs(point);
		}
	}
}
void bfs(int x){  //广度优先遍历
	queue <int> q;
	q.push(x);
	cout<<x<<" ";
	vis2[x]=1;
	while(!q.empty()){
		int fro=q.front();
		for(int i=0;i<e[fro].size();i++){
			int point=s[e[fro][i]].v;
			if(!vis2[point]){
				q.push(point); 
				cout<<point<<" ";
				vis2[point]=1;
			}
		}
		q.pop();
	}
}
int main(){
	int n,m;  //输入，存边
	cin>>n>>m; 
	for(int i=0;i<m;i++){
		int uu,vv;
		cin>>uu>>vv;
		s.push_back((edge){uu,vv});   
	}
	sort(s.begin(),s.end(),cmp);  //排序
	for(int i=0;i<m;i++)   
		e[s[i].u].push_back(i); 
	dfs(1);   //从1号顶点开始深搜
	cout<<endl;
	bfs(1);   //广搜亦同理
}

3.图的遍历（图论）

输入：

4 3
1 2
2 4
4 3

反向建变+bfs，

按题目来每次考虑每个点可以到达点编号最大的点，不如考虑较大的点可以反向到达哪些点

循环从N到1，则每个点i能访问到的结点的A值都是i

每个点访问一次，这个A值就是最优的，因为之后如果再访问到这个结点那么答案肯定没当前大了

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;

#define MAXL 100010

int N, M, A[MAXL];
vector<int> G[MAXL]; //vector存图 

void dfs(int x, int d) {
	if(A[x]) return; //访问过 
	A[x] = d;
	for(int i=0; i<G[x].size(); i++)
		dfs(G[x][i], d);
}

int main() {
	int u, v;
	scanf("%d%d", &N, &M);
	for(int i=1; i<=M; i++) {
		scanf("%d%d", &u, &v);
		G[v].push_back(u); //反向建边 
	}
	for(int i=N; i; i--) dfs(i, i); 
	for(int i=1; i<=N; i++) printf("%d ", A[i]);
	printf("\n");
	return 0;
}

4.最大生产（AcWing，二分）

输入：

3 1
2 1 4
11 3 16

二分

#include <iostream>
using namespace std;
using LL = long long;

const int N = 100010, INF = 2e9 + 1;

int n, k;
int a[N], b[N];

bool ok(LL m) {
	int left = k;
	for (int i = 1; i <= n; i++) {
		LL need = a[i] * m;
		if (need > left + b[i]) return 0;
		if (need > b[i]) left -= need - b[i];
	}
	return 1;
}

int main() {
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= n; i++) scanf("%d", a + i);
	for (int i = 1; i <= n; i++) scanf("%d", b + i);

	LL l = 0, r = INF;
	while (l < r) {
		int m = (l + r + 1)/2;
		if (ok(m)) l = m;
		else r = m - 1;
	}
	printf("%d\n", l);

	return 0;
}

5.