__water

静态模拟家谱树#include <stdio.h>#include <string.h>struct node{ char name[15]; int bcnt,scnt,son[105];}a[105];int ans;void _find(int x,int y){ if(ans)return; for(int i=0;i<a[y].scnt;i++

#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <queue>#include <map>#include <cmath>#include <iostream>#include <set>#include <vector>#define INF 0x3f3f3f3f

#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <queue>#include <map>#include <cmath>#include <iostream>#include <set>#include <vector>#define INF 0x3f3f3f3f

注意点： 看代码注释#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <queue>#include <map>#include <cmath>#include <iostream>#include <set>#include <vector>#define INF

#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <queue>#include <map>#include <cmath>#include <iostream>#include <set>#include <vector>#define INF 0x3f3f3f3f

#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#define INF 0x3f3f3f3fusing namespace std;const int N=505;int n,m,s,d;int ren[N];int ma[N][N];int cnt[N];int vis[N];in

#include <cstdio>#include <cstring>#include <algorithm>using namespace std;struct node{ int u,v,len;}a[3005];int cmp(node x,node y){ return x.len<y.len;}int f[1005];int find(int x){

双关键字，关于K1的二叉搜索树，关于K2的最小堆。 判断中序遍历是否为递增，即可判断是否为二叉搜索树。 最小堆 看路径是否递增即可。#include<stdio.h>#include<string.h>#include<stdlib.h>struct node{ int l,r,k1,k2;}a[1005];int num[1005],cnt=0,flag;int vis[

xjb水过。。。#include <stdio.h>#include <string.h>#include <stdlib.h>char s[10005][280];struct node{ int cnt; char str[280];}ss[10005];int cmp(const void *a ,const void *b){ return strcm

//最重要的是细心#include <stdio.h>#include <stdlib.h>#include <cstring>#define ElementType int#define ERROR 1e5typedef enum { push, pop, inject, eject, end } Operation;typedef struct Node *PtrToNode;st

给你n个命令，然后有2种命令，添加消息，每个消息都带有一个数字表示优先级，数字越小，越早输出， 一种是读取信息，输出现在优先级最高的。 由于只能用C，那么手写了一个最小堆模拟优先队列。#include <stdio.h>#include <string.h>struct node{ int pp; char ss[11];}cur,q[100005];int main(

1001：