সাবলিস্ট মুছে দিয়ে k-এর চেয়ে ছোট ও বড় উপাদান সমান রাখা C++-এ

#include 
using namespace std;

class Solution {
public:
    int solve(vector& nums, int k) {
        vector v(nums.size() + 1, 0);
        int cnt = 0;
        for (int i = 0; i < nums.size(); ++i) {
            if (nums[i] < k) ++cnt;
            else if (nums[i] > k) --cnt;
            v[i + 1] = cnt;
        }
        if (v.back() == 0) return nums.size();
        int delta = v.back();
        map m;
        int ans = INT_MAX;
        for (int i = 1; i <= v.size(); ++i) {
            if (m[v[i] - v.back()] != 0 || v[i] - v.back() == 0) {
                ans = min(ans, i - m[v[i] - v.back()]);
            }
            m[v[i]] = i;
        }
        if (ans == INT_MAX) return 0;
        else return nums.size() - ans;
    }
};

int main(){
    Solution ob;
    vector v = {6, 10, 8, 9, 3, 5};
    int k = 6;
    cout << ob.solve(v, k);
    return 0;
}

5