leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0962.cpp (520B)

0 class Solution { 1 public: 2 int maxWidthRamp(const vector<int> &nums) const { 3 vector<pair<int, int>> vec; 4 int res = 0; 5 6 for (int i = 0; i < size(nums); i++) { 7 if (empty(vec) || vec.back().first > nums[i]) 8 vec.emplace_back(nums[i], i); 9 else { 10 const auto opt = lower_bound(begin(vec), end(vec), make_pair(nums[i], INT_MAX), greater()); 11 res = max(res, i - opt->second); 12 } 13 } 14 15 return res; 16 } 17 };