16:I[88039,["/_next/static/chunks/4e30b08c358694e7.js","/_next/static/chunks/38b4a60e15728925.js","/_next/static/chunks/2e0b5bf50bec0481.js","/_next/static/chunks/efcb5152408fccf7.js","/_next/static/chunks/1784c135295ff646.js"],"default"] 17:I[30863,["/_next/static/chunks/4e30b08c358694e7.js","/_next/static/chunks/38b4a60e15728925.js","/_next/static/chunks/2e0b5bf50bec0481.js","/_next/static/chunks/efcb5152408fccf7.js","/_next/static/chunks/1784c135295ff646.js"],"default"] 18:T4d2,#include #include #include #include #include using namespace std; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; vector arr(n); for (int i = 0; i < n; i++) { cin >> arr[i]; } deque dqMax, dqMin; int left = 0, ans = -1; for (int right = 0; right < n; right++) { while (!dqMax.empty() && arr[dqMax.back()] <= arr[right]) { dqMax.pop_back(); } dqMax.push_back(right); while (!dqMin.empty() && arr[dqMin.back()] >= arr[right]) { dqMin.pop_back(); } dqMin.push_back(right); while (left <= right && (arr[dqMax.front()] - arr[dqMin.front()]) > k) { if (dqMax.front() == left) dqMax.pop_front(); if (dqMin.front() == left) dqMin.pop_front(); left++; } assert(dqMax.size() > 0 && dqMin.size() > 0); if (arr[dqMax.front()] - arr[dqMin.front()] == k) { ans = max(ans, right - left + 1); } } cout << ans; return 0; }

Submission #65

Source Code