Advertisement
Guest User

Untitled

a guest
May 27th, 2019
87
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.50 KB | None | 0 0
  1. int Solve(const vector<int>& data) {
  2.     unordered_map<int, int> last_seen;
  3.     unordered_map<int, int> max_waiting_time;
  4.  
  5.     for (int i = 0; i < data.size(); ++i) {
  6.         int route = data[i];
  7.         if (last_seen.count(route) > 0) {
  8.             max_waiting_time[route] = max(max_waiting_time[route], i - last_seen[route]);
  9.         }
  10.         last_seen[route] = i;
  11.     }
  12.  
  13.     int ans = 0;
  14.     for (const auto& time : max_waiting_time)
  15.         ans = max(ans, time.second);
  16.     return ans;
  17. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement