Mr_Treeeee的博客

RXD and dividing Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 1253    Accepted Submission(s): 527 Problem Description RXD has

时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 32768K，其他语言65536K 64bit IO Format: %lld 题目描述  In country  A, some roads are to be built to connect the cities。However, due to limited funds, only

D. Roads not only in Berland time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Berland Government decided to

Fibonacci Tree Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5838    Accepted Submission(s): 1821 Problem Description 　　Coach Pan

Qin Shi Huang's National Road System Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8709    Accepted Submission(s): 3084 Problem Desc

The Unique MST Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 31994   Accepted: 11572 Description Given a connected undirected graph, tell if its minimum sp

Transfer water Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 5373    Accepted Submission(s): 1947 Problem Description XiaoA lives

Ice_cream’s world II Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5665    Accepted Submission(s): 1437 Problem Description After

Command Network Time Limit: 1000MS   Memory Limit: 131072K Total Submissions: 18879   Accepted: 5434 Description After a long lasting war on words, a war on arms finall

You are part of a group of n teenage girls armed with cellphones. You have some news you wantto tell everyone in the group. The problem is that no two of you are in the same room, and you mustcommu

点击打开链接题意：把有n个节点的一棵树分成n/k棵树。保证b%k=0。输出每棵树的节点序号。否则输出NO。POINT：输出序号可以借助stack。对于每个根节点，看每条子树还有多少节点。因为每个子树要形成一个树（假设他们合起来为个数为k），必须要用到根节点。所以对于每个子树的节点加起来，在加上1（根节点）。如果大于k，就NO了。要正好等于k，才符合题意。若小于k，那么回溯往前面合并。#includ...