Question:-
/*
___ ___ ___ ___ ___
/\ \ /\ \ /\ \ /\__\ ___ /\ \
\:\ \ /::\ \ /::\ \ /:/ / /\ \ /::\ \
___ /::\__\ /:/\:\ \ /:/\:\ \ /:/ / \:\ \ /:/\ \ \
/\ /:/\/__/ /::\~\:\ \ /::\~\:\ \ /:/__/ ___ /::\__\ _\:\~\ \ \
\:\/:/ / /:/\:\ \:\__\ /:/\:\ \:\__\ |:| | /\__\ __/:/\/__/ /\ \:\ \ \__\
\::/ / \/__\:\/:/ / \/_|::\/:/ / |:| |/:/ / /\/:/ / \:\ \:\ \/__/
\/__/ \::/ / |:|::/ / |:|__/:/ / \::/__/ \:\ \:\__\
/:/ / |:|\/__/ \::::/__/ \:\__\ \:\/:/ /
/:/ / |:| | ~~~~ \/__/ \::/ /
\/__/ \|__| \/__/
*/
#include <bits/stdc++.h>
using namespace std;
long long int getMaxLength(long long int arr[],long long int n)
{
long long int l = n;
long long int i = 0, maxlen = 0;
while (i < l)
{
long long int j = i;
while (i+1 < l &&
(abs(arr[i] - arr[i + 1])>0))
{
i++;
}
long long int currLen = i - j + 1;
if (maxlen < currLen)
maxlen = currLen;
if (j == i)
i++;
}
return maxlen;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--)
{
long long int q,i,j,cnt=0,n,p1,p2,x,y;
cin>>n>>q;
long long int a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(j=0;j<q;j++)
{
cin>>x;
cin>>y;
a[x-1]=y;
cout<<getMaxLength(a,n)<<endl;
}
}
}
any test case for which it’ll fail?