easy short efficient clean code
\nclass Solution {\npublic:\ntypedef long long ll;\n#define vi(x) vector<x>\nint maximizeWin(vector<int>&v, int k) {\n    ll n=v.size(), ans=0;\n    vi(ll)dp(n)
```\nclass Solution {\npublic:\ntypedef long long ll;\n#define vi(x) vector<x>\nint maximizeWin(vector<int>&v, int k) {\n    ll n=v.size(), ans=0;\n    vi(ll)dp(n);\n    for(ll i=0, j=0;i<n;++i){\n        while(j<i && v[i]-v[j]>k){\n            ++j;\n        }\n        dp[i]=max(i?dp[i-1]:0, i-j+1);\n        ans=max(ans, i-j+1+(j?dp[j-1]:0));\n    }\n    return ans;\n}\n};\n```
['Dynamic Programming', 'C', 'Sliding Window']