pat
Miqiuha
这个作者很懒,什么都没留下…
展开
-
PAT Build A Binary Search Tree[C++]
#include using namespace std; struct Node { int v; int L; int R; } node[102]; int R[102]; int DNS(int i,int count) //中根遍历。 { if(node[i].L!=-1) count=DNS(node[i].L,count);原创 2018-02-02 00:45:06 · 198 阅读 · 0 评论 -
PAT The Largest Generation [c++]
#include #include #include #include using namespace std; vector tree[102]; int N; int main() { int M; cin>>N>>M; int num,t,temp; for(int i=0; i<M; i++) { cin>>num>>t;原创 2018-01-27 18:52:33 · 151 阅读 · 0 评论 -
PAT A+B for Polynomials
1002. A+B for Polynomials (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThis time, you are supposed to find A+B where A and B are two polynomials.InputEach input file contains one test...原创 2018-04-23 14:59:04 · 169 阅读 · 0 评论 -
PAT 1003 Emergency
原文1003. Emergency (25)时间限制400 ms内存限制32000 kB代码长度限制16000 B判题程序Standard作者CHEN, YueAs an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scatter...转载 2018-04-26 22:26:45 · 217 阅读 · 0 评论 -
PAT Deepest Root -并查集+树的直径
题目链接:https://pintia.cn/problem-sets/994805342720868352/problems/9948054829196738561021 Deepest Root (25)(25 分)A graph which is connected and acyclic can be considered a tree. The height of the tree de...原创 2018-06-13 17:52:39 · 205 阅读 · 0 评论