1713B - Optimal Reduction - CodeForces Solution


constructive algorithms sortings *1000

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
    n = int(input()) 
    a = [int(i) for i in input().split()] 
    ans = "YES" 
    c = False
    for i in range(1, n): 
        if a[i-1] > a[i] : c = True 
        elif a[i-1] < a[i] and c : ans = "NO"; break 
    print(ans)

C++ Code:

#include <bits/stdc++.h>
using namespace std;
int main(){
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        int a[n+1];
        int l=1,r=n;
        for(int i=1;i<=n;i++){
            cin>>a[i];
        }
        while(l<n && a[l]<=a[l+1]){
            l++;
        }
        while(r>1 && a[r]<=a[r-1]){
            r--;
        }
        if(r<=l) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

577A - Multiplication Table
817C - Really Big Numbers
1355A - Sequence with Digits
977B - Two-gram
993A - Two Squares
1659D - Reverse Sort Sum
1659A - Red Versus Blue
1659B - Bit Flipping
1480B - The Great Hero
1519B - The Cake Is a Lie
1659C - Line Empire
515A - Drazil and Date
1084B - Kvass and the Fair Nut
1101A - Minimum Integer
985D - Sand Fortress
1279A - New Year Garland
1279B - Verse For Santa
202A - LLPS
978A - Remove Duplicates
1304A - Two Rabbits
225A - Dice Tower
1660D - Maximum Product Strikes Back
1513A - Array and Peaks
1251B - Binary Palindromes
768B - Code For 1
363B - Fence
991B - Getting an A
246A - Buggy Sorting
884A - Book Reading
1180A - Alex and a Rhombus