CODEFORCES 1145A

CODEFORCES 

1145A - THANOS SORT

Link to Ques - Codeforces 1145A
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
import java.util.Scanner;

public class CF1145A {

    static int[] arr;

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        arr = new int[in.nextInt()];
        for(int i = 0; i < arr.length; i++) {
            arr[i] = in.nextInt();
        }
        System.out.println(dp(0, arr.length));
    }

    static int dp(int l, int r) {
        for(int i = l+1; i < r; i++) {
            if(arr[i] < arr[i-1]) {
                int mid = (l+r)/2;
                return Math.max(dp(l, mid), dp(mid, r));
            }
        }
        return r-l;
    }
}

Comments

  1. Anonymous5 March 2022 at 02:03

    Titanium Edc - Tile Art - TI-TITanium
    TIPTOBET. The TOTO-TITanium titanium gr 5 was a bronze resin resin resin titanium build for kodi resin resin titanium guitar chords resin resin titanium eyeglasses resin resin resin resin resin resin resin resin resin resin resin resin resin resin ford ecosport titanium resin resin resin resin resin

    ReplyDelete

Post a Comment

Popular posts from this blog

Class 12 Physics Practicals

Image
Physics Practicals Class 12 Hey everyone...I have uploaded my Physics Practical . Clearly, it was the most hectic practical file. After lots of corrections and cross-checking, i finally decided to upload this. All the practicals included in the file are as per the CBSE guidelines. Hope this helps you. All the best for the Board Examinations and VIVA😂😂... Hasta La Vista !!✌✌✌ Link: physics practical pdf
Read more

CODEFORCES 390A

CODEFORCES  390A - Inna and Alarm Clock Link to Ques -  Codeforces 390A 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 import java.util.Arrays ; import java.util.Scanner ; public class CF390A { public static void main ( String [] args ) { Scanner sc = new Scanner ( System . in ); int visx [] = new int [ 110 ]; int visy [] = new int [ 110 ]; Arrays . fill ( visx , 0 ); Arrays . fill ( visy , 0 ); int n = sc . nextInt (); for ( int i = 0 ; i < n ; i ++) { int x = sc . nextInt (); int y = sc . nextInt (); visx [ x ]= 1 ; visy [ y ]= 1 ; } int cx = 0 , cy = 0 ; for ( int i = 0 ; i < 110 ; i ++) { if ( visx [ i ]== 1 ) cx ++; if ( visy [ i ]== 1 ) cy...
Read more