Head_Hard的博客

传送门 题意：寻找路线中出现次数最多的字母个数； 判断是否有回路，如果有回路就可以无限循环就直接输出-1，如果没有回路，则可以用dfs或者拓扑排序解决 dfs： #include using namespace std; const int MAX = 3e5 + 7; vector v[MAX]; char s[MAX]; int vis[MAX], a[MAX][26], ans =

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

Genealogical tree Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6790   Accepted: 4413   Special Judge Description The system of Martians' blood relations

Gym Class Time Limit: 6000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2169    Accepted Submission(s): 829 Problem Description 众所周知，度度熊喜欢各类体育活动。

Rank of Tetris Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11156    Accepted Submission(s): 3192 Problem Description 自从Lele开发了Ratin

Sorting It All Out Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 38571   Accepted: 13588 Description An ascending sorted sequence of distinct values is one in which so...