Codeforces Round #656 (Div. 3) 1385C - Make It Good Solution




Problem Link :  https://codeforces.com/problemset/problem/1385/C 

Solution in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long n,t,i,r,a;
    cin>>t;
    while(t--)
    {
        cin>>n;
        long long a[n+3],ans=1;
        for(i=1; i<=n; i++)
            cin>>a[i];
        if(is_sorted(a+1,a+n+1))
            cout<<"0"<<endl;
        else
        {
            for(i=n-1; i>=1; i--)
            {
                if(a[i]>=a[i+1])
                    ans++;
                else
                    break;
            }
            for(; i>=1; i--)
            {
                if(a[i]<=a[i+1])
                    ans++;
                else
                    break;
            }
            cout<<n-ans<<endl;

        }
    }
}



 


No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.