A. Tender Carpenter solution code

[@computerknowledge4217]

Like and Subscribe guys 👍
A.
In C++ language
#include
using namespace std;
#define int long long
int32_t main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
vectorvec(n);
for(int i=0;i>vec[i];
}

bool c=true;
for(int i=0;i=0 && vec[i-1]>=vec[i])
{
if(2*vec[i]>vec[i-1])
{
c=false;
break;
}
}
else if(i-1>=0 && vec[i-1]vec[i])
{
c=false;
break;
}
}
if(i+1=vec[i])
{
if(2*vec[i]>vec[i+1])
{
c=false;
break;
}
}
else if(i+1

[@computerknowledge4217]

Like and Subscribe guys..👍

[@ShomyaSoneji]

please share this code in comments

[@computerknowledge4217]

A.
In C++ language
#include
using namespace std;
#define int long long
int32_t main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
vectorvec(n);
for(int i=0;i>vec[i];
}

bool c=true;
for(int i=0;i=0 && vec[i-1]>=vec[i])
{
if(2*vec[i]>vec[i-1])
{
c=false;
break;
}
}
else if(i-1>=0 && vec[i-1]vec[i])
{
c=false;
break;
}
}
if(i+1=vec[i])
{
if(2*vec[i]>vec[i+1])
{
c=false;
break;
}
}
else if(i+1

[@MultiUniverseExolore-s8m]

correct code do bhai

[@computerknowledge4217]

A.
In C++ language
#include
using namespace std;
#define int long long
int32_t main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
vectorvec(n);
for(int i=0;i>vec[i];
}

bool c=true;
for(int i=0;i=0 && vec[i-1]>=vec[i])
{
if(2*vec[i]>vec[i-1])
{
c=false;
break;
}
}
else if(i-1>=0 && vec[i-1]vec[i])
{
c=false;
break;
}
}
if(i+1=vec[i])
{
if(2*vec[i]>vec[i+1])
{
c=false;
break;
}
}
else if(i+1