C++ 算法题：序列众数可能值计数 - 解题思路与代码实现

#include #include #include <unordered_map> #include using namespace std;

int main() { int n, k; cin >> n >> k; vector a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } unordered_map<int, int> count; for (int i = 0; i < n; i++) { count[a[i]]++; } int max_count = 0; for (auto it = count.begin(); it != count.end(); it++) { max_count = max(max_count, it->second); } int ans = 0; for (auto it = count.begin(); it != count.end(); it++) { if (it->second == max_count) { ans++; } } if (ans == 1 && k == 1) { cout << "pigstd" << endl; } else { cout << ans << endl; } return 0; }