猿辅导 8.1 笔试第一题
看到有人用vector这么做就过了,为什么用map过不了呢?
#include <iostream> #include <map> using namespace std; int main() { int N; cin >> N; map<int, int>m; int max = -1; for (int i = 0; i < N; i++) { int Si, Ei; cin >> Si >> Ei; for (int j = Si; j < Ei; j++) { m[j]++; if (m[j] > max) max = m[j]; } } cout << max << endl; system("pause"); return 0; }