Thursday, 6 April 2017

Geeksforgeeks Solution For " Max value "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Max value

Submit Your Solution :- Click Here 

Solution :- 

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,i,j,sum,res=0;
        cin>>n;
        int arr[n];
        for(i=0;i<n;i++)
        cin>>arr[i];
        for(i=0;i<n;i++)
        {
            for(j=i+1;j<n;j++)
            {
                sum=abs((arr[i]-i)-(arr[j]-j));
                if(res<sum)
                res=sum;
            }
        }
        cout<<res<<endl;
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Max value "

No comments:
Write comments

Recommended Posts × +