lizhenhao

#include <iostream>#include <cstring>#include <algorithm>using namespace std;int A, B, C, D;int _find(int x){ for(int i = 30; i >= 0; i --) if(x >> i & 1) return i; return 0;}int lg(int x){ int k.

#include<iostream>#include <cstring>#include <algorithm>#include <queue>using namespace std;const int N = 2e3 + 10;int flag[N];int id[N][N];pair<int, int> inputs[N];int n, m, k, s, t;int d[4][2] = {0, 1, 0, -1, -1,.

模拟题 + 简单的递归#include <bits/stdc++.h>using namespace std;//2H2+2Cl2=4HClint find_ep(string &s){ for(int i = 0; i < s.size(); ++ i) if(s[i] == '=') return i; return -1;}//2//H2void work_2(string word, map<string,int> &am

做不动LCT,就来敲个模拟题解解气吧dfs 存个结构体维护信息 排个序 然后没了#include <iostream>#include <cstring>#include <algorithm>using namespace std;const int N = 1e4+10, M = 1e6+10;int n, cnt;int h[N], tot;struct {int to,nxt;}e[M];int houses[N], area[N],v

bfs + 记忆化搜索(剪枝）#include <bits/stdc++.h>using namespace std;const int N = 310;int a[N],b[N],f[N][N][N],n;bool dfs(int u){ if(u == n + 1) { if((a[n - 1] + a[n]) / 2 == b[n]) return true; return false; } for(int i = 0; i < 3; ++i) {

头一次见这么夸张的剪枝操作。这个点也很难想2*r*h=S *r*r*h=V * =>V*2/r = SS + sumS >= best => return;#include <cstdio>#include<algorithm>#include<cmath>using namespace std;int bes...