摘要:
DescriptionA rooted tree is a well-known data structure in computer science and engineering. An example is shown below:In the figure, each node is lab... 阅读全文
摘要:
DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 #include#include#include#include#include#include#include... 阅读全文
摘要:
DescriptionIt's almost summer time, and that means that it's almost summer construction time! This year, the good people who are in charge of the road... 阅读全文
摘要:
DescriptionIn order to get from one of the F (1 2 and 1 –> 6 –> 5 –> 21 – 4: 1 –> 2 –> 3 –> 4 and 1 –> 6 –> 5 –> 43 – 7: 3 –> 4 –> 7 and 3 –> 2 –> 5 ... 阅读全文
摘要:
题目描述 xiaoY is crazy about solving equations! But since teacher HH tells him that when an equation’s degree is bigger than 3, there are no analytic sol... 阅读全文
摘要:
以后要开始在cf上做题目了,在那里可以开到世界各国的大神的代码,可以和他们一起享受比赛,以后cf的题目不会在发那么多报告了,若真的特别经典的,我才写写自己的总结 阅读全文
摘要:
题目描述Given an N*N(N#include#include#includeusing namespace std;const int maxn=1001;int group[maxn][maxn];bool vis[maxn][maxn];int dx[4]={0,0,1,-1};int ... 阅读全文
摘要:
题目描述Given a number sequence whose length is n, you can delete at most k numbers in the sequence.After that you are asked to answer the maximum length ... 阅读全文
摘要:
题目描述Halloween is coming! So xiaoY has to prepare M candies to treat the neighbor kids.When this horrible night come, There are N little children ask x... 阅读全文
摘要:
题目描述有m个盒子,第i个盒子的长尾hi,宽为wi。如果两个盒子i,j满足hi#include#includeusing namespace std;const int maxn=20001;struct node{ int x,y;}box[maxn];int a[maxn];bool cm... 阅读全文