yjt9299的博客

确定比赛名次Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29319    Accepted Submission(s): 11681Problem Description有N个比赛队（1 

Legal or NotTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9250    Accepted Submission(s): 4311Problem DescriptionACM-DIY is a

RewardTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10105    Accepted Submission(s): 3219Problem DescriptionDandelion's uncle

Rank of TetrisTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10596    Accepted Submission(s): 3030Problem Description自从Lele开发了R

PondsTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 5247    Accepted Submission(s): 1454Problem DescriptionBetty owns a lot of ponds, some of...

F. Tree Restorationtime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputThere is a tree of n vertices. For each vertex a list of all its successors is known (not ...

链接：https://www.nowcoder.com/acm/contest/142/J来源：牛客网Chiaki has just learned hash in today's lesson. A hash function is any function that can be used to map data of arbitrary size to data of fixed si...

链接：http://codeforces.com/problemset/problem/919/D题意： 每个节点有个颜色，现在有n 个节点和m条边，现在要找出一条路径使得走过的点的颜色相同的数量最大。输出数量。可能出现环或者平行边。如果答案为inf 输出-1。思路： 每个节点只受其后边节点（拓扑）的影响，意思是我如果能够确定该节点后边所有节点的状态，那么这个节点肯定也是能确定的，并且满足...