摘要: 牛客挑战赛49 tjc的签到 ll ans = -1, w = 0; int main() { IOS; map<int, int> st; cin >> n; rep (i, 1, n) cin >> m, ++st[m]; for (auto &i : st) if (umax(ans, (ll 阅读全文
posted @ 2021-04-17 17:46 洛绫璃 阅读(77) 评论(0) 推荐(1) 编辑