guojiaqi007的专栏

https://www.patest.cn/contests/pat-a-practise/1101 参考了： http://www.sigmainfy.com/blog/pat-advanced-1101-quick-sort.html 用了动态规划，记录每个元素左边的最大值，右边的最小值。查看当前元素是否比左边的最大大，比右边的最小小。 #include #inc

https://www.patest.cn/contests/pat-a-practise/1003 #include #include #include using namespace std; pair dijstra(vector> g, vector hands,int c1,int c2,int n) { vector v(n, 0); vector dist(n, IN

https://www.patest.cn/contests/pat-a-practise/1004 这个题做的不好一开始用 链接法构造树，但是发现如果有的节点的孩子信息先给出，但是他的父节点的孩子信息还没给出（就是这个点还没建出来）。是会出问题的。 开始就就没想到！！！啊！ 后来参考了： http://www.liuchuo.net/archives/2229 #i

https://www.patest.cn/contests/pat-a-practise/1007 #include #include int main() { int a[10000],n,maxSum=INT_MIN,maxBegin,maxEnd=0,sum=INT_MIN,begin = 0; scanf("%d", &n); for (int i = 0; i

https://www.patest.cn/contests/pat-a-practise/1021 照抄了http://blog.youkuaiyun.com/jtjy568805874/article/details/50805402 里面用到了求树的半径的方法， 1）用任何一个点dfs 找到最深的深度，所有深度最深的node 是半径上的点。 2）再用任意一个半径上的点dfs，找到

https://www.patest.cn/contests/pat-a-practise/1023 #include #include #define rep(i,j,k) for(int i=j;i<=k;i++) const int maxn = 100; char s[maxn]; int b[maxn], c[maxn], len, x; bool flag; int main(

https://www.patest.cn/contests/pat-a-practise/1048 参考了http://blog.youkuaiyun.com/jtjy568805874/article/details/50858073 水题，想了dp，二分。 后来看了题解才发现好简单。 #include #define inone(i) scanf("%d",&i) #d

https://www.patest.cn/contests/pat-a-practise/1042 hash 一下顺序， 然后就是dp了。 #include #include using namespace std; #define rep(i,j,k) for(int i=j;i<=k;i++) #define inone(i) scanf("%d",&i) const int

https://www.patest.cn/contests/pat-a-practise/1010 代码来自http://blog.youkuaiyun.com/jtjy568805874/article/details/50782565 #include #include #include using namespace std; typedef unsigned long l

https://www.patest.cn/contests/pat-a-practise/1011 代码来自 http://blog.youkuaiyun.com/jtjy568805874/article/details/50782588 #include #include using namespace std; double x, y, z, ans = 1; int mai

https://www.patest.cn/contests/pat-a-practise/1012 使用基数排序 部分代码参考了：http://blog.youkuaiyun.com/jtjy568805874/article/details/50782867 #include int wc[4][102]; int ids[1000001]; int scor[2001][4]

https://www.patest.cn/contests/pat-a-practise/1013 代码来自http://blog.youkuaiyun.com/jtjy568805874/article/details/50791941 #include #include #include using namespace std; typedef struct edge { i

1042. Shuffling Machine (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Shuffling is a procedure used to randomi

https://www.patest.cn/contests/pat-a-practise/1026 根据http://blog.youkuaiyun.com/jtjy568805874/article/details/50809719 修改 #include #include using namespace std; #define inthree(i,j,k) scanf("%d%d%d"

https://www.patest.cn/contests/pat-a-practise/1040 参考了： https://segmentfault.com/a/1190000003914228 http://blog.youkuaiyun.com/jtjy568805874/article/details/50856440 #include #include #inc

1043. Is It a Binary Search Tree (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A Binary Search Tree (BST) is r

https://www.patest.cn/contests/pat-a-practise/1002 使用stl 版 #include #include #include using namespace std; int main() { int k,a; double b; map M; map::iterator it; for (int i = 0; i < 2

https://www.patest.cn/contests/pat-a-practise/1123 参考了：http://www.liuchuo.net/archives/2732 #include #include using namespace std; typedef struct node { int v; struct node * left, *right;

https://www.patest.cn/contests/pat-a-practise/1122 参考了：http://www.liuchuo.net/archives/2748 #include #include #include using namespace std; int ** graph; bool isConnected(int *v, int n)

https://www.patest.cn/contests/pat-a-practise/1103 参考了： http://blog.youkuaiyun.com/apie_czx/article/details/48415197 此题不是素数的分解，所以用了搜索，因为k不大，n也不大。 直接用pow(i,p) 会超时 从小到大遍历，如果出现sum相同的（there i

https://www.patest.cn/contests/pat-a-practise/1105 #include #include #include #include int dir[4][2] = { {0,1},{1,0},{0,-1},{-1,0} }; int N,m, n,map[1001][1001],a[1000001]; bool myGreater(i

https://www.patest.cn/contests/pat-a-practise/1106 找最近的叶节点， bfs。 #include #include #include using namespace std; typedef struct node { int k; vector edges; }Node; int n; double r, price;

https://www.patest.cn/contests/pat-a-practise/1107 这道题我觉得有点歧异 如果 3个人 分别喜欢 1 2 2 4 4 6 算几个圈子，我觉得是两个（1，2），和（2，3），因为1和3没有共同的爱好。 但是pat的过的例子任何是一个圈子（1，2，3） ， 1和3可以通过2联系起来。 #include #inclu

https://www.patest.cn/contests/pat-a-practise/1108 笨方法： #include #include #include using namespace std; bool to2Doboule(string s, double &f) { double res = 0.0; int i = 0; if (s[i] == '-') i+

https://www.patest.cn/contests/pat-a-practise/1109 #include #include #include #include #include using namespace std; typedef struct peo { string name; int height; friend bool operator < (s

https://www.patest.cn/contests/pat-a-practise/1110 层序遍历，如果没有child时打标记，如果再出现inValid #include #include #include #include #include #include #define MAXN 21 using namespace std; typedef s

https://www.patest.cn/contests/pat-a-practise/1111 #include #include #include #include #include using namespace std; int timeC[500][500],len[500][500],visit[500],dist[500], from[500],nNode[500

https://www.patest.cn/contests/pat-a-practise/1112 #include #include #include #include #include using namespace std; bool map[256]; int main() { vector stuckKeysPre; set stuckKey; int k, reps

https://www.patest.cn/contests/pat-a-practise/1113 #include #include using namespace std; int a[100001],k,n; void quicksort(int l,int r) { swap(a[l], a[(l + r) / 2]); if (l > r) return; i

https://www.patest.cn/contests/pat-a-practise/1114#include #include #include #include #include #include #include #include #include using namespace std; typedef struct family { int minId; in

https://www.patest.cn/contests/pat-a-practise/1115 #include typedef struct node { int v; struct node * left, * right; node(int x) :left(NULL),right(NULL) { v = x; } }Node; int deep,n1,n

https://www.patest.cn/contests/pat-a-practise/1117 #include #include using namespace std; int a[1000001]; int main() { fill(a, a + 100001, 0); int n,len,maxLen = 0; scanf("%d",&n); for (int i

https://www.patest.cn/contests/pat-a-practise/1119 #include typedef struct node { int v; struct node * left, *right; node(int x) : left(NULL), right(NULL) { v = x; } }Node; bool build(No

https://www.patest.cn/contests/pat-a-practise/1016 #include #include #include #include #include #include #define _CRT_SECURE_NO_WARNINGS using namespace std; typedef struct item { int typ

1020. Tree Traversals (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Suppose that all the keys in a binary tree