fayaz

 #include <iostream>

using namespace std;

int main() {
int n;cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}

int flagfornegative=0;
int maxcount=0;
int currentcount=0;
for(int i=0;i<n;i++)
{
if(arr[i]<0)
{

currentcount+=1;
flagfornegative=1;

}
else
{
flagfornegative=0;
currentcount=0;
}


if(maxcount<currentcount)
{
maxcount=currentcount;
}

}


if(maxcount==1)
{
int maxx=arr[0];
for(int i=1;i<n;i++)
{
if(arr[i]<0)
{
if(arr[i]<maxx)
{
maxx=arr[i];
}
}
}
long sum=0;
for(int i=0;i<n;i++)
{
if(arr[i]!=maxx)
{
sum+=arr[i];
}
else{
sum=sum+=-maxx;
}
}

cout<<sum;

}


}

Comments

Popular posts from this blog

Problem no 18(array):count the number of pairs in array whose sum is equal to the given number.

convert the integer number to its binary representation.

Tcs assessment problem: museum problem.