qq_45455670的博客

简单模拟#include <bits/stdc++.h>using namespace std;int n, k, m;double res[10010];bool cmp(double a, double b){ return a > b;}int main(void){ cin >> n >> k >> m; int score[k]; for (int i = 0; i < n; i++)

#include <bits/stdc++.h>using namespace std;typedef struct{ int id; char sex; int fa, ma;} P;const int N = 100100;P p[N];void dfs(int s, int idx, set<int> &S){ if (idx >= 5) return; if (p[s].fa != -1 &

每次保存每个隧道的队尾列车标号，找到最接近上一个车尾的，将它顶掉。#include <bits/stdc++.h>using namespace std;int main(void){ int n; cin >> n; set<int> S; S.insert(9999999); for (int i = 0; i < n; i++) { int x; cin >>

用并查集做，真是牛逼！！#include <bits/stdc++.h>using namespace std;const int N = 510;int n, m;typedef struct{ int v, u;} Edge;Edge edge[N * 10];int father[N];int find(int x){ int a = x; while (x != father[x]) { x = father[x];

#include <bits/stdc++.h>using namespace std;const int N = 35;int inArr[N];int preArr[N];typedef struct Node{ int val; Node *lchild; Node *rchild;} Node, *Tree;void LayerOrder(Tree tree){ queue<Tree> Q; Q.push(tree);

测试点1：00001 300001 1 0000200002 2 -100003 3 00004一个变态的测试点思路：利用映射进行排序#include <bits/stdc++.h>using namespace std;const int N = 100010;typedef struct{ int address; int v; int next; int w;} Node;Node node[N];bool vis[N];boo

并查集模板#include <bits/stdc++.h>using namespace std;const int N = 110;int Friend[N];bool Enemy[N][N];int findFriend(int x){ int a = x; while (Friend[x] != x) { x = Friend[x]; } //路径压缩 while (a != x) { i

没啥难的，但是写了好久，哭了o(╥﹏╥)o#include <bits/stdc++.h>using namespace std;const int N = 10010;typedef struct{ int idx; double money; int cnt;} Node;Node node[N];bool cmp(Node a, Node b){ if (fabs(a.money - b.money)<0.0001) {

一：暴力枚举可过#include <bits/stdc++.h>using namespace std;const int N = 1010;char str[N];bool isOK(int l, int r){ while (l < r) { if (str[l] != str[r]) { return false; } l++; r--; }

并查集，不太好写#include <bits/stdc++.h>using namespace std;const int N = 10010;int father[N];int find(int x){ int a = x; while (x != father[x]) { x = father[x]; } while (a != x) { int tmp = father[a]; fa

知道一棵二叉树的先序或后序再知道中序，即可将该二叉树构造出来#include <bits/stdc++.h>using namespace std;const int N = 35;int postArr[N], inArr[N];typedef struct Node{ int v; Node *lchild; Node *rchild;} Node, *Tree;Tree create(int postL, int postR, int inL, i

利用stl中的set做就好技巧：两个集合的元素总个数=两个集合个数相加减去相同元素的个数#include <bits/stdc++.h>using namespace std;const int N = 55;set<int> S[N];int main(void){ int n; cin >> n; for (int i = 1; i <= n; i++) { int k; cin &g

二叉搜索树模板题#include <bits/stdc++.h>using namespace std;typedef struct Node{ int v; Node *lchild; Node *rchild;} Node, *Tree;//存放遍历结果vector<int> ori, pre, mirpre, post, mirpost;Node *newNode(int x){ Node *node = (Node *)mal

题目说库存量和售价是正数也就说可能是小数，真奇怪，难道卖半块月饼？？#include <bits/stdc++.h>using namespace std;typedef struct{ double cnt; double sum; double ave;} Node;const int N = 1010;Node node[N];bool cmp(Node a, Node b){ return a.ave > b.ave;}int m