1199A - City Day - CodeForces Solution

implementation *1000

Please click on ads to support us..

Python Code: 

n,x,y = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(n):
    take= True
    for j in range(max(0,i-x),min(n-1,i+y)+1):
                if i!=j and arr[i]>=arr[j]:
            take = False
        
    if take: print(i+1);break

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
int main()
{
     int n,x,y;
     cin>>n>>x>>y;
     int arr[n];
     for(int i=0;i<n;i++)
     cin>>arr[i];
     for(int i=0;i<n;i++)
     {
        bool flag=false;
        //left
        for(int j=i-1;j>=i-x&&j>=0&&!flag;j--)
        if(arr[j]<=arr[i])
        flag=true;
        if(flag)
        continue;
        //right
        for(int j=i+1;j<n&&j<=i+y&&!flag;j++)
        if(arr[j]<=arr[i])
      flag=true;
        if(!flag)
        {
          cout<<i+1;
          return 0;
        }
     }
}


Comments

Submit
0 Comments
More Questions

1047B - Cover Points
1381B - Unmerge
1256A - Payment Without Change
908B - New Year and Buggy Bot
979A - Pizza Pizza Pizza
731A - Night at the Museum
742A - Arpa’s hard exam and Mehrdad’s naive cheat
1492A - Three swimmers
1360E - Polygon
1517D - Explorer Space
1230B - Ania and Minimizing
1201A - Important Exam
676A - Nicholas and Permutation
431A - Black Square
474B - Worms
987B - High School Become Human
1223A - CME
1658B - Marin and Anti-coprime Permutation
14B - Young Photographer
143A - Help Vasilisa the Wise 2
320A - Magic Numbers
1658A - Marin and Photoshoot
514A - Chewbaсca and Number
382A - Ksenia and Pan Scales
734B - Anton and Digits
1080A - Petya and Origami
1642D - Repetitions Decoding
1440A - Buy the String
1658F - Juju and Binary String
478A - Initial Bet