#include iostream#include setusing namespace std;setstring s;int geti(string a,string b){for(int i=0;ia.size();i++){if(a[i]!=b[i]) return i;}return a.size();}int main(){//freopen("file.in","r",stdin); string t; while(cint){ s.insert(t); }se

点我呐

#include iostream#include cstring#include algorithmusing namespace std;int tree[105],n,m,x,y;int par[105];int root,maxn;int main(){memset(tree,-1,sizeof(tree));//fill(tree,tree+105,-1); cinnm;while(m--){cinxy;tree[y]=x;par[x]++;if(par[maxn]

点我呐

#include iostream#include mapusing namespace std;int main(){ int a[105]={};int n,m,x,y;mapint,int mp;cinnm;while(m--){cinxy;if(mp[x]) mp[x]++;else mp[x]=1;a[y]=x;}int root=1;while(a[root]!=0) root=a[root];int maxt=0,maxr=0;for(int i=1;i=n;i

点我呐

#include iostreamusing namespace std;char c[100050];void createnode(int i){char a;cina;if(a=='.'){return ;}else{c[i]=a;createnode(2*i);createnode(2*i+1);}}void zx(int i){if(c[i]){zx(i*2);coutc[i];zx(i*2+1);}}void hx(int i){if(c[i]){hx(i*2);

点我呐

#include iostream#include queueusing namespace std;struct node{char c;node *left,*right;};int k=0;char a;string s="12300400506700800";node *createtree(){node *p;//cina;a=s[k++];if(a!='.'){p=new node;p-c=a;p-left = createtree();p-right = cre

点我呐

#include iostream#include cstringusing namespace std;struct node{ int id; int n; int t,l,r;} poi[105];int n;int vis[105],ans=2147483647;int getsum(int i,int h){ if(i==0||vis[i]==1) return 0; vis[i]=1; int sum=0; sum+=getsum(poi[i].t,h+1); s

点我呐

暂未更新

点我呐

#include iostreamusing namespace std;int n,m;long long a[100050];long long l=0,r=0;bool f(int mid){ int cnt=1; long long sum=a[1]; for(int i=2;i=n;i++){ if(sum+a[i]mid){ cnt++; sum=a[i]; } else sum+=a[i]; } return cnt=m;}int main() { cinnm;

点我呐