G_rass的专栏

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Status Description — The Brother of mine, the Head of Monastic Order wants to know tomorrow about

思路：可看做求所有出现的数中次数最高的 次数，用hash的方法， 这里练一下模板 #include #include #include #define MOD 1000007 #define base 31 #define N 1000009 using namespace std; struct note { int v,cnt,next; }_hash[N]; int k;