丁一的博客

#include<iostream>#include<vector>#include<algorithm>using namespace std;vector<int> origin,CBT;int index=0,N;void inOrder(int root){ if(root>=N) return; inOrder(2...

#include<iostream>#include<vector>#include<algorithm>using namespace std;int N,M,S;struct node{ int data; vector<int> child;}; vector<node> v;vector<int>...

#include<iostream>#include<vector>#include<algorithm>#include<map>using namespace std;int rate[25]={0};struct node{ string name; int month,day,hour,mintue,time; int s...

编号 题目 考点 1003 Emergency 最短路径 1004 Counting Leaves 树的遍历 1007 Maximum Subsequence Sum 动态规划 1013 Battle Over Cities 图的遍历,连通块 1016 Phone Bills map,vector,排序 ...

#include<iostream>#include<vector>#include<cstring>#include<queue>using namespace std;vector<vector<int> > user; int N,L,M,K;bool vis[1010];struct node{ i...

#include<iostream>#include<map>using namespace std;int N,K,cnt=1,e[2010][2010]={0},weight[2010]={0};map<string,int> stringToInt,ans;map<int,string> intToString;bool vis[...

#include<iostream>#include<map>#include<cstring>using namespace std;int N,K,weight[210],e[210][210],w[210],d[210],pre[210],pt[210],num[210];const int inf=1000000000;string st;...

#include<iostream>#include<cstring>#include<vector> #include<cmath>using namespace std;int const inf=1000000000;int Cmax,N,Sp,M,e[510][510],d[510],weight[510],minSend=in...

#include<iostream>#include<cstring>using namespace std;const int inf=1000000000; int N,M,C1,C2,e[510][510],weight[510],num[510],w[510],d[510];bool vis[510]; void dijkstra(int start)...

#include<iostream>#include<cstring>using namespace std;const int inf=1000000000;int N,M,K,Ds,e[1100][1100],d[1100];bool vis[1100];int getID(string s){ int res=0; for(int i=0;i<...

#include<iostream>#include<vector>using namespace std;vector<int> v[100];int cnt[110];bool vis[110]={false};int maxdepth=0;void dfs(int index,int depth){ if(maxdepth<dept...

#include<iostream>#include<vector>#include<queue>#include<algorithm>using namespace std;struct node{ int val,left,right;};vector<node> v;vector<int> orig...

#include<iostream>#include<vector>using namespace std;int N;vector<int> origin,post,postM,pre,preM;struct node{ int val; struct node *left,*right;}; void insert(node* &...

#include<iostream>using namespace std;struct node{ int val; struct node *left,*right;};int getHeight(node* &root){ if(root==NULL) return 0; else return max(getHeight(root->left),...

#include<iostream>#include<cstring>using namespace std;const int inf=1000000000;int N,M,S,D,e[510][510],cost[510][510],d[510],c[510],pre[510];bool vis[510];void dij(int start){ mem...

#include<iostream>using namespace std;int father[10010];int cnt[10010]={0};//计算每棵树上鸟的数目 bool exist[10010];int findFather(int x){ int z=x; while(x!=father[x]) x=father[x]; while(z!=fat...

#include<iostream>#include<vector>#include<set>#include<cstring>using namespace std;vector<vector<int> > v;vector<int> temp;bool vis[10010]={false};i

#include<iostream>#include<vector>using namespace std;vector<int> v; int M,N;void postOrder(int index){ if(index>=N) return; postOrder(2*index+1); postOrder(2*index+2); ...

#include<iostream>#include<stack>#include<cstring>using namespace std;stack<int> st;int cnt[100010]={0},table[316]={0};void Push(int x){ cnt[x]++; table[x/316]++; st....

#include<iostream>#include<vector>#include<unordered_map>#include<cmath> #include<algorithm>using namespace std;vector<int> v[10000];unordered_map<int,bo...

/* 1.红结点是负数 2.红结点的孩子结点一定是黑结点 3.任一结点到其每个叶子结点的所有路径包含的黑结点个数相同 */ #include<iostream>#include<math.h>using namespace std;struct node{ int val; struct node *left,*right;};void inser...

#include<iostream>#include<vector>using namespace std;int main(){ int N,flag=0,dp[100010],s[100010]; scanf("%d",&N); vector<int> v(N); for(int i=0;i<N;i++){ scanf("%...

#include<iostream>#include<vector>using namespace std;vector<int> v;int main(){ int M,N,L,num,maxn=0,dp[10010],hash[210]; scanf("%d%d",&N,&M); for(int i=1;i<=M;i++...

#include<iostream>using namespace std;int ans=1,dp[1010][1010];//空间比较大，在main()之前开空间 int main(){ string s; getline(cin,s); for(int i=0;i<s.length();i++){ dp[i][i]=1; if(i!=s.length(...

#include<iostream>#include<queue>using namespace std;struct node{ int rrank,weight;};int main(){ int Np,Ng,num;//总人数，每组人数 scanf("%d%d",&Np,&Ng); vector<node> v(Np);...

/* 需要添加最少的线使非连通块成为一个连通块 线的个数最少为非连通块的个数减1 */#include<iostream>#include<vector>#include<cstring> using namespace std;vector<vector<int> > v;bool vis[1010];void d...

#include<iostream>using namespace std;int main(){ string s; int N; cin>>s>>N; while(--N){ string t; int cnt=0; char pre=s[0]; for(int i=0;i<s.length();i++){ if(s...

#include<iostream>#include<vector>using namespace std;int e[210][210];int main(){ int Nv,Ne,M,K,a,b; scanf("%d%d",&Nv,&Ne); for(int i=0;i<Ne;i++){ scanf("%d%d",&a,...

#include<iostream>#include<map>#include<vector>#include<algorithm>using namespace std;struct node{ string name; int scoreB=0,scoreA=0,scoreT=0,tws=0,num=0; int rrank;...

#include<iostream>#include<vector>#include<algorithm>using namespace std;bool cmp(string a,string b){ return a+b<b+a;}int main(){ int n; string s; cin>>n; vector...

#include<iostream>#include<queue>using namespace std;int M,N,L,T;int v[1300][130][70];bool vis[1300][130][70]={false};int X[6]={1,-1,0,0,0,0};int Y[6]={0,0,1,-1,0,0};int Z[6]={0,0...