Halfcoke

整体思路是用链表来做的。数据结构用下图表示。注意事项：在递归插入的时候，传递地址过去时要加上引用，否则遇到 } 无法将next指针设置成null，也就无法判断那一层的链表的结束位置，会产生错误。问题虽然很简单，但是在排查的时候不容易看见，浪费了几个小时。具体实现请见代码。# include<stdio.h># include<algorithm># incl...

csp 201503-3 节日# include<stdio.h># include<algorithm># include<string># include<sstream># incl

# include<stdio.h># include<algorithm># include<sstream># include<iostream># include<string># in

# include<stdio.h># include<stdlib.h># include<iostream># include<string># include&a

主要思路是：将角色信息读入，并用map进行权限映射；然后将用户信息读入，按照角色依次将权限映射导入用户信息当中；思路比较直接。# include<iostream># include<stdio.h># include<stdlib.h># include<algorithm># include<sstream># inclu...

主要思路：将有后代和无后代的分开考虑，无后代的比较简单，有后代的的主要思路是，先将所有满足最后一个条件的行数找出来，依次遍历这些行数，看是否有满足前面A条件的，如果该行都没有满足A条件的，那把这个行数删除，注意细节处理每行的级数以及要选择的是B条件的祖先，B条件的叔叔辈不能选。# include<string># include<sstream># include&l...

# include<stdio.h># include<algorithm># include<string># include<vector># include<sstream># include<iostream>using namespace std;void check(string &t){...