Search is not available for this dataset
name stringlengths 2 112 | description stringlengths 29 13k | source int64 1 7 | difficulty int64 0 25 | solution stringlengths 7 983k | language stringclasses 4
values |
|---|---|---|---|---|---|
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
using pii = pair<int, int>;
const int N = 2e5 + 10;
int a[N];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
int mi;
for (int i = n; i > 0; i--) {
... | CPP |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
import threading
from bisect import bisect_right
from math import gcd,log
from collections import Counter
def main():
for _ in range(int(input())):
n=int(input())
arr=list(map(int,input().split()))
i=n-2
whi... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import os
import sys
from io import BytesIO, IOBase
def main():
import math
t=int(input())
while(t):
t-=1
n=int(input())-1
li=[int(i) for i in input().split()]
prev=-math.inf
while(n>=0 and li[n]>=prev):
prev=li[n]
n-=1
while(n>=0 and li[n]<=prev):
prev=li[n]
n-=1
print(n+1)
# region fasti... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.util.*;
public class hai {
public static boolean ispossible(int[] a,int k) {
int low = k+1,high=a.length-1;
boolean flag = false;
int prev=-1;
while(low<=high) {
int cure =0;
if(a[low]<a[high]) {
cure=a[low];
low++;
}else if(a[low]>a[high]) {
cure=a[high];
high... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | # possibilities = []
# for a in range(1, 10):
# for b in range(1, 10):
# if set([a, 15-a-b, b, 5+b-a, 5, 5+a-b, 10-b, a+b-5, 10-a]) == set(range(1, 10)):
# possibilities.append([a, 15-a-b, b,
# 5+b-a, 5, 5+a-b,
# 10-b, a+b-5, 10... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | def solve(n,d):
big = float('inf')
small = float('-inf')
if n < 3:
return 0
peak = -1
for i in range(n - 1,0,-1):
if d[i] > d[i - 1]:
peak = i
break
# print(peak)
ans = 0
if peak > -1:
for i in range(peak - 1,0,-1):
if d[i] < d[... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #!/usr/bin/env python
from __future__ import division, print_function
import itertools, os, sys, threading
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
# region fastio
BUFSIZE = 8192
class ... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t = int(input())
for i in range(t):
n = int(input())
a = list(map(int, input().split()))
ans = 0
fl = 0
a.reverse()
for j in range(n-1):
if a[j+1] < a[j]:
fl = 1
if fl == 1 and a[j+1]>a[j]:
ans = n-(j+1)
break
print (ans) | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n = int(input())
l = list(map(int, input().split()))
if sorted(l) == l:
print(0)
continue
for i in range(n-2, -1, -1):
if l[i] < l[i+1]:
break
for j in range(i, -1, -1):
if l[j] < l[j-1]:
break
if j == -1:
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for t in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
l = n-2
ans = 0
while a[l] >= a[l+1] and l >= 0:
l -= 1
ans += 1
while a[l] <= a[l+1] and l >= 0:
l -= 1
ans += 1
print(n - ans - 1) | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for t in range(int(input())):
n = int(input())
A = list(map(int,input().split()))
i = n-1
while i>0 and A[i]<=A[i-1]:
i-=1
while i>0 and A[i]>=A[i-1]:
i-=1
print(i)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t=int(input())
for i in range(t):
n=int(input())
a=list(map(int,input().split()))
i=len(a)-1
flag=0
max=a[i]
while i>=0:
if a[i]<max:
break
max=a[i]
i=i-1
if (i!=-1):
while(i>=0):
if a[i]>a[i+1]:
break
i=i-1
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | // package Round656;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.*;
public class typeC {
public static void main(String[] args) {
FastReader s = new FastReader();
int T = s.nextInt();
while(T-->0) {
int n = s.... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | # from debug import debug
import sys;input = sys.stdin.readline
t = int(input())
for _ in range(t):
n = int(input())
lis = list(map(int, input().split()))
i = n-1
while i>0 and lis[i-1]>=lis[i]: i-=1
i-=1
while i>=0 and lis[i]<=lis[i+1]: i-=1
print(i+1)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | try:
t = int(input())
for _ in range(t):
n = int(input())
a = [int(x) for x in input().split()]
pos = n-1
while(pos>0 and a[pos-1]>=a[pos]):
pos-=1
while(pos>0 and a[pos-1]<=a[pos]):
pos-=1
print(pos)
except:
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import sys
t = int(input())
while t:
n = int(input()) - 1
s = list(map(int, sys.stdin.readline().split()))
rs = s.copy()
rs.reverse()
i = 0
while i < n:
if rs[i] <= rs[i+1]:
i += 1
else:
break
j = i
while i < n:
if rs[i] >= rs[i+1]:
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t = int(input())
while (t>0):
n = int(input())
a=list(map(int,input().split()))
#print(a)
flag =0
i=n-1
while i>0:
if (a[i]-a[i-1] <0):
i = i-1
while (i>0) and (a[i]-a[i-1]<=0):
i = i-1
while (i>0) and (a[i]-a[i-1]>=0):
i = i-1
flag =1
print(i)
break
elif (a[i]- a[i-1] >0):
i = i-... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | def do_good(n: int, arr: list):
max_num = 2 * (10 ** 5)
len_good_arr = 1
for i in range(n-2, -1, -1):
if arr[i] > max_num:
break
if arr[i] < arr[i+1]:
max_num = arr[i]
len_good_arr += 1
return n - len_good_arr
t = int(input())
for i in range(t):
n ... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
stat = 0
idx = 0
for i in range(n-2, -1, -1):
if a[i]<a[i+1]:
stat = 1
elif stat==1 and a[i]>a[i+1]:
idx = i+1
break
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for i in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
if(l==sorted(l)):
print(0)
else:
p=n-1
while(p and l[p]<=l[p-1]):
p=p-1;
while(p and l[p]>=l[p-1]):
p=p-1
print(p)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import sys
input = sys.stdin.readline
n = int(input())
for _ in range(n):
m = int(input())
vals = list(map(int, input().split()))
r = len(vals) - 1
while r > 0 and vals[r - 1] >= vals[r]:
r -= 1
while r > 0 and vals[r - 1] <= vals[r]:
r -= 1
print(r)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | n = int(raw_input())
for _ in xrange(n):
x = int(raw_input())
ar = map(int, raw_input().split())
crescer = True
diminuir = False
ans = 0
for k in xrange(x-2, -1, -1):
if diminuir and ar[k+1] < ar[k]:
ans = k + 1
break
if ar[k+1] > ar[k]:
... | PYTHON |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter pw = new PrintWriter(System.out);
int Q = sc.ni();
for (int q = 0; q < Q; q++) {
int N = sc.ni();
int[] nums = new int[N];
for (in... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import sys
def readStr():
return sys.stdin.readline().rstrip()
def readInts():
return list(map(int, readStr().split(' ')))
def main(n, a):
if n <= 1:
return 0
direction = 'increase'
for i in range(n-1):
if direction == 'increase':
if a[-i-2] >= a[-i-1]:
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | from time import time
from random import randint
#file = open("C:/Users/marko/Google Drive/Programmering/Python/put.txt", "r")
def isGood(arr):
l = 0
r = len(arr)-1
while l < r:
lowest = min(arr[l], arr[r])
if (arr[l+1] <= arr[r-1] and arr[l+1] >= lowest):
l += 1
elif ... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.util.*;
import java.lang.*;
import java.io.*;
public class GFG
{
public static void main(String[] args) throws Exception {
// TODO Auto-generated method stub
InputReader s = new InputReader(System.in);
PrintWriter p = new PrintWriter(System.out);
int w=s.nextInt();
while(w-->0) {
int n=s.next... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | def solve(A, n):
pos = n - 1
while pos > 0 and A[pos - 1] >= A[pos]: pos -= 1
while pos > 0 and A[pos - 1] <= A[pos]: pos -= 1
return pos
res = []
t = int(input())
while t:
n = int(input())
arr = input().split(' ')
A = [int(n) for n in arr]
res.append(solve(A, n))
t -= 1
for r in r... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #!/usr/bin/env python3
'''
Author: andyli
Time: 2020-07-17 22:42:46
'''
import os
from io import BytesIO, IOBase
import sys
def main():
for _ in range(int(input())):
n = int(input())
a = list(map(int,input().split()))
mx = n
for i in range(n-2,-1,-1):
if a[i] < a[i+1... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | # ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | from time import time
from random import randint
#file = open("C:/Users/marko/Google Drive/Programmering/Python/put.txt", "r")
def isGood(arr):
l = 0
r = len(arr)-1
while l < r:
lowest = min(arr[l], arr[r])
if (arr[l+1] <= arr[r-1] and arr[l+1] >= lowest):
l += 1
elif ... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
i=0
j=n-1
p=0
k=[]
while i<n-1 and j>i:
if a[i]>=a[j]:
if len(k)==0 or a[j]>=k[-1] :
k.append(a[j])
j-=1
elif a[j]<k[-1]:
k=[]
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import sys
import math
import bisect
from sys import stdin, stdout
from math import gcd, floor, sqrt, log
from collections import defaultdict as dd
from bisect import bisect_left as bl, bisect_right as br
from collections import Counter
#sys.setrecursionlimit(100000000)
inp = lambda: int(input())
strng = lambda: inpu... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import sys
t = int(input())
while t!=0:
t-=1
n = int(input())
arr = list(map(int,input().split(' ')))
pos = n-1
while pos>0 and arr[pos]<=arr[pos-1]:
pos-=1
while pos>0 and arr[pos]>=arr[pos-1]:
pos-=1
print(pos)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n = int(input())
arr = [int(f) for f in input().split()]
pos = n-1
while(pos>0) and arr[pos-1]>=arr[pos]:
pos-=1
while(pos>0) and arr[pos-1]<=arr[pos]:
pos-=1
print(pos)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class test {
public static class MyScanner {
BufferedReader br;
StringTokenizer st;
public MyScanner() {
br = new BufferedReader(new InputStreamReader(Syste... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t = int(input())
for k in range(t):
n = int(input())
*a, = map(int, input().split())
ans = 0
pref_right = [0] * (n + 1)
pref_left = [a[0]] + [0] * n
for i in range(n - 1, -1, -1):
pref_right[i] = max(pref_right[i + 1], a[i])
for i in range(1, n):
pref_left[i] = max(pref_l... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
scanf("%d", &n);
int maxi = 0;
int arr[n];
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int i;
for (i = n - 1; i > 0 && arr[i - 1] >= arr[i]; i--)
;
for (; i > 0 && arr[i - 1] <= arr[i]; i--)
;
printf("%d\n", i)... | CPP |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #include <bits/stdc++.h>
const int maxn = 200005;
int a[maxn];
int main(void) {
int t, n;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (register int i = 1; i <= n; ++i) scanf("%d", &a[i]);
register int i = n - 1;
while (1 <= i && a[i + 1] <= a[i]) --i;
while (1 <= i && a[i] <= a[i + 1])... | CPP |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | n = int(input())
while n:
n -= 1
z = int(input())
count = z - 1
lst = list(map(int, input().split()))
while count> 0 and lst[count-1]>=lst[count]:
count-=1
while count > 0 and lst[count - 1] <= lst[count]:
count -= 1
print(count) | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t=int(input())
for _ in range(t):
n=int(input())
arr=[int(x) for x in input().split()]
if(n<=2):
print(0)
continue
greatLeft=[-1 for i in range(n)]
greatRight=[-1 for i in range(n)]
stack=[]
for i in range(n):
length=len(stack)
while(length>0 and arr[stack[length-1]]<arr[i]):
greatRi... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #Consistency is the key.
#code by: amrit2000
from sys import stdin,stdout
import math
input=stdin.readline
def print(x='',y='',end='\n'):
if y=='':
stdout.write(str(x)+end)
else:
stdout.write(str(x)+' '+str(y)+end)
def solve():
n=int(input())
l=list(map(int,input().split()))
idx=n-1... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | try:
t=int(input())
for v in range(t):
n=int(input())
a=list(map(int,input().split()))
i=len(a)-1
maximum=a[-1]
while(i>=0):
if (a[i]<maximum):
break;
maximum=a[i]
i-=1
#print("max=",maximum)
if (i==-1):
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import math
from collections import defaultdict,deque
from bisect import bisect_left,bisect_right
from sys import stdin
def mp():return map(int,stdin.readline().split())
def ml():return list(map(int,stdin.readline().split()))
for _ in range(int(input())):
n=int(input())
a=ml()
mx1=[0]*n
mx2=[0]*(n... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | ii = lambda: int(input())
t=ii()
for h in range(t):
n=ii()
a=list(map(int, input().split()))
c1 = 0
i = (n - 1)
while(i > 0):
if a[i] <= a[i - 1]:
c1 = c1 + 1
i = i - 1
else:
break
if i== 0:
c1 += 1
elif(i!=0):
j = i
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t = int(input())
for _ in range(t):
n = int(input())
arr = list(map(int,input().split()))
i = n-1
while arr[i-1]>=arr[i] and i>0:
i-=1
while arr[i-1]<=arr[i] and i>0:
i-=1
print(i)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writabl... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | from sys import stdin
def readline():
return stdin.readline()
tests = int(readline())
def solve(n, a):
f = a[n - 1] > a[n - 2]
k = 0
j = 1 if f else 2
for i in reversed(range(0, n)):
if (f and a[i] < a[i - 1]) or (not f and a[i] > a[i - 1]):
k += 1
f = not f
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.util.*;
public class prob_C_cf656 {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
int n,j=0;
while((t--)>0) {
n=sc.nextInt();
int[] arr=new int[n];
for(int i=0;i<n;i++) {
arr[i]=sc.nextInt();
}
if(n<2) {
System.out.println("... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979323846;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t, i, j;
cin >> t;
while (t--) {
long long n;
cin >> n;
vector<long long> a(2 * n);
for (i = 0; i < n; i++) cin >> a[i];
... | CPP |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import bisect
import decimal
from decimal import Decimal
import os
from collections import Counter
import bisect
from collections import defaultdict
import math
import random
import heapq
from math import sqrt
import sys
from functools import reduce, cmp_to_key
from collections import deque
import threading
from itert... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #headers
import sys
import os
from collections import Counter, deque, defaultdict
import itertools
import math
import io
#inputs
def ii():return int(input())
def li():return list(map(int,input().split()))
def mi():return map(int,input().split())
#fns
def gcd(x, y): # math.gcd is slower
""" returns greatest commo... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writa... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import sys
import math
import heapq
import bisect
from collections import Counter
from collections import defaultdict
from io import BytesIO, IOBase
import string
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
import os
self.os = os
self._fd = file.fileno()
self.... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
if n ==1:
print(0)
continue
for i in range(n-1,0,-1):
if a[i-1]<a[i]:break
i-=1
while i>0:
if a[i-1]>a[i]:break
i-=1
print(i) | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import sys
import math
import bisect
from sys import stdin, stdout
from math import gcd, floor, sqrt, log
from collections import defaultdict
from bisect import bisect_left as bl, bisect_right as br
from collections import Counter
ip = lambda : int(stdin.readline())
inp = lambda: map(int,stdin.readline().split())
t =... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | from sys import stdin
input = stdin.readline
for _ in range(int(input())):
n = int(input())
a = list(map(int,input().split()))
f = 0
ans = 0
for i in range(n-2, -1, -1):
if f==0 and a[i]<a[i+1]:
f = 1
elif f==1 and a[i]>a[i+1]:
ans = i + 1
br... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t = int(input())
for test in range(t):
n = int(input())
arr = [int(x) for x in input().split()]
inc = True
dec = False
done = False
for i in range(n-1, 0, -1):
if inc and arr[i-1]<arr[i]:
inc=False
dec=True
if dec and arr[i-1]>arr[i]:
print(i)
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t=int(input())
for _ in range(t):
n=int(input())
li=list(map(int,input().split()))
c=1
for i in range(len(li)-1,0,-1):
if(li[i]<=li[i-1]):
c=c+1
else:
break
if(c==len(li)):
print(0)
continue
li=li[0:len(li)-c]
p=0
for i in... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.util.*;
public class MyClass {
public static void main(String args[]) {
Scanner in=new Scanner(System.in);
int t=in.nextInt();
for(;t>0;t--){
int n=in.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++) arr[i]=in.nextInt();
int... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
i=n-2
incele=1
while i>=0:
if a[i]<=a[i+1]:
incele+=1
else:
break
i-=1
decele=1
i=n-2
while(i>=0):
if a[i]>=a[i+1]:
decele+=1
else:
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import os
import sys
from io import BytesIO, IOBase
# from collections import defaultdict as dd
# from collections import deque as dq
# import itertools as it
# from math import sqrt, log, log2
# from fractions import Fraction
def main():
t = int(input())
for _ in range(t):
n = int(input())
#x,... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// write your code here
Scanner scan = new Scanner(System.in);
int t= scan.nextInt();
while (t-->0) {
int n= scan.nextInt();
int[] array= new int[n];
for (int... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for t in range(int(input())):
n = int(input())
arr = list(map(int, input().split()))
ans = n-1
while ans > 0 and arr[ans-1] >= arr[ans]:
ans-=1
while ans > 0 and arr[ans-1] <= arr[ans]:
ans-=1
print(ans)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class scratch
{
public static void main(String[] args)
{
FastReader reader = new FastReader();
PrintWriter out = new PrintWriter(System.out);
int t =... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.InputMismatchException;
public class Round656C {
public static void solve() {
int t = s.nextInt();
while(t-- > 0) {
int n = s.nextInt();
int[... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | T = int(input())
for _ in range(T):
N = int(input())
a = list(map(int, input().split()))
i = N - 1
while i > 0:
if a[i] > a[i-1]:
break
i -= 1
while i > 0:
if a[i] < a[i-1]:
break
i -= 1
print(i)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.io.*;
import java.util.*;
public class Main {
static Scanner sc = new Scanner(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws Exception {
int t = sc.nextInt();
while(t-- > 0) {
int n = sc.nextInt(), arr[] = new int[n];
for(int i ... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n = int(input())
a = list(map(int,input().split()))
q=n-1
while a[q]<=a[q-1] and q!=0:
q-=1
#if q==0:
# print(q);
while a[q]>=a[q-1] and q!=0:
q-=1
#if q==0:
# print(q);
print(q)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 |
import java.util.ArrayList;
import java.util.Scanner;
public class C {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int num = input.nextInt();
for(int i = 0; i < num; i++) {
int n = input.nextInt();
ArrayList<Integer> arr = new ArrayList<>();
for(int j = 0; j < n;... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
l.reverse()
flag=-1
count=1
if n==1:
print(0)
continue
for i in range(1,n):
# print(flag)
if l[i]==l[i-1]:
count+=1
continue
elif l[i]>l[i-1] and fla... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t = int(input())
n_list = [0 for i in range(t)]
array_list = [[] for i in range(t)]
for i in range(t):
n_list[i] = int(input())
temp = input()
array_list[i] = temp.split()
for j in range(len(array_list[i])):
array_list[i][j] = int(array_list[i][j])
out_list = [0 for i in range(t)]
for i in ra... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.util.*;
import java.io.*;
public class CodeForces {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
int t = sc.nextInt();
while (t-- > 0) {
int n = sc.nextInt();
int[] a = new int[n];
for (int i = 0; i < a.length; ... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | from sys import stdin
def main():
l = stdin.read().splitlines()[2::2]
for i, s in enumerate(l):
*aa, a = map(int, s.split())
while aa and aa[-1] >= a:
a = aa.pop()
while aa and aa[-1] <= a:
a = aa.pop()
l[i] = str(len(aa))
print('\n'.join(l))
if __... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t = int(input())
for _ in range(t):
n = int(input())
l = list(map(int,input().split()))
ans = n
now = 0
count = 0
li = 0
for i in l[::-1]:
if i >= now:
now = i
count += 1
else:
li = count
break
if count == n:
print(0... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
if n<=2:
print(0);continue
ci=1
cd=1
for i in range(0,n-1):
if a[i]<=a[i+1]:ci+=1
elif a[i]>=a[i+1]:cd+=1
if ci==n or cd==n:print(0)
else:
j=n-1
ans=0
fg=0
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
i = 0
while i < (len(a)-1):
if a[i] > a[i+1]:
break
i += 1
if i == len(a) - 1:
print(0)
else:
start = 0; end = len(a)-1; m = -9999999999
count = 0
while... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.io.*;
import java.util.*;
public class Main{
public static void main(String[] args) {
PrintWriter out=new PrintWriter(System.out);
InputReader in=new InputReader(System.in);
int t=in.nextInt();
while(t-->0) {
int n=in.nextInt();
int [] a=in.readArray(n);
int s=0,e=s;
int i=... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n = int(input())
a = [int(x) for x in input().split()]
pos = n - 1
while pos != 0 and a[pos - 1] >= a[pos]:
pos -= 1
while pos != 0 and a[pos - 1] <= a[pos]:
pos -= 1
print(pos)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | from sys import stdin
input = stdin.readline
T = int(input())
for case in range(T):
N = int(input())
Nums = [*map(int,input().split())]
flip=False
Ans=0
for i in range(N-1,0,-1):
if not flip and Nums[i]>Nums[i-1]:
flip=True
elif flip and Nums[i]<Nums[i-1]:
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class Main implements Runnable
{
static class InputReader
{
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFi... | JAVA |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
int i = n - 1;
while (i >= 1 && a[i - 1] >= a[i]) i--;
int j = i... | CPP |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n=int(input())
A=list(map(int,input("").split()))
ans=0
flag=0
for i in range(len(A)-2,-1,-1):
if flag==1 and A[i]>A[i+1]:
ans=i+1
break
if A[i]<A[i+1]:
flag=1
print(ans)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t=int(input())
for _ in range(t):
n=int(input())
l=list(map(int,input().split()))
j=n-1
while(j>0):
if l[j-1]>=l[j]:
j-=1
continue
break
while(j>0):
if l[j]>=l[j-1]:
j-=1
continue
break
print(j)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n = int(input())
a = [int(i) for i in input().split()]
pos = n-1
while pos>=1 and a[pos-1]>=a[pos]:
pos-=1
while pos>=1 and a[pos-1]<=a[pos]:
pos-=1
print(pos) | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int mod = 1e9 + 7, N = 2e5 + 5, inf = 1e9;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
int n, arr[N];
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
i... | CPP |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import math
import datetime
import collections
import statistics
import itertools
def is_prime(num):
for i in range(2, int(math.sqrt(num)) + 1):
if num % i == 0:
return False
return True
def input_list():
ll = list(map(int, input().split(" ")))
return ll
tc = int(input())
for ... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for t in range(int(input())):
n=int(input())
a=[int(i) for i in input().split(" ")]
p=n-1
while p>0 and a[p-1]>=a[p]:
p=p-1
while p>0 and a[p-1]<=a[p]:
p=p-1
print(p) | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for t in range(int(input())):
n=int(input())
arr=list(map(int,input().strip().split()))
arr.reverse()
c=0
once=False
i=0
while i<n-1 and not once:
if arr[i]<=arr[i+1]:
i+=1
else:
once=True
i+=1
if i==n-1:
print(0)
else:
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n = int(input())
arr = list(map(int,input().split()))
c = 0
arr = arr[::-1]
inc = True
i = 0
while i<len(arr)-1:
if inc:
if arr[i+1]>=arr[i]:
c+=1
else:
inc = False
c+=1
else:
if arr[i+1]<=arr[i]:
c+=1
else:
c+=1
inc = True
break
i+=1
i... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | def main():
for __ in [0]*int(input()):
N = int(input())
*A, = map(int, input().split())
p = A[-1]
for i in range(N-1, -1, -1):
if A[i] < p:
break
p = A[i]
for i in range(i, -1, -1):
if A[i] > p:
print(i+1)
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t=int(input())
final=[]
for j in range(t):
n=int(input())
l=[int(x) for x in input().split()]
hot=0
for i in range(len(l)-1):
h=min(l[len(l)-1-i],l[len(l)-2-i])
if(h!=l[len(l)-1-i]):
hot=len(l)-2-i
break
for i in range(hot):
h=min(l[hot-i],l[hot-1-i])
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t=int(input())
for i in range(t):
n=int(input())
a=list(int(num) for num in input().split())
k=n-1
while k>0:
if a[k]<=a[k-1]:
k-=1
else:
break
while k>0:
if a[k]>=a[k-1]:
k-=1
else:
break
print(k)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t = int(input())
def solve(arr):
n = len(arr)
x = sorted(arr)
if arr == x or arr == x[::-1] or n == 1:
return 0
arr = arr[::-1]
i = 0
while i < n-1 and arr[i+1]>=arr[i]:
i += 1
ans1 = i
i = 0
while i < n-1 and arr[i+1]<=arr[i]:
i += 1
ans2... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | def sol(lis):
i = len(lis)-1
while i>0 and lis[i-1]>=lis[i]:
i-=1
while i>0 and lis[i-1]<=lis[i]:
i-=1
print(i)
k = int(input())
for i in range(k):
input()
lis = list(map(int,input().split(' ')))
sol(lis)
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t=int(input())
i=0
while i<t:
n=int(input())
arr=list(map(int,input().split()))
if n<=2:
print(0)
else:
j=n-1
while j>0 and arr[j-1]>=arr[j]:
j=j-1
while j>0 and arr[j-1] <=arr[j]:
j=j-1
print(j)
i=i+1
| PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | #Fuck you idoit read the question properly non-decarsing not non-incresing wasted a lot of time in it
t=int(input())
def fun(n,a):
ans=-1
i=0
j=n
a.reverse()
while i+1<n and a[i]<=a[i+1]:
i+=1
while i+1<n and a[i]>=a[i+1]:
i+=1
print(n-i-1)
while t:
t-=1
n=int(input()... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
import math
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math as M
MOD=10**9+7
from random import randint as R
import sys
#####################################
for _ in range(int(input())):
n... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | t=int(input())
while(t):
t=t-1
n=int(input())
a=list(map(int,input().split()))
if(len(set(a))==1):
print(0)
else:
flag,flag2=False,True
for i in reversed(range(n)):
if(a[i]<a[i-1] and flag):
print(i)
flag2=False
brea... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | for _ in range(int(input())):
n = int(input())
A = list(map(int,input().split()))
d =[]
for i in range(1,n):
d.append(A[i]-A[i-1])
ca=-1;ans=0
for i in range(len(d)):
if(d[i]<0):
ca=i
if(d[i]>0 and ca>=0):
if(i-ca>1):
ans = ca+1
... | PYTHON3 |
1385_C. Make It Good | You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a_1, a_2, ..., a_n] is a subarray consisting several first elements: the prefix of the array a of length k... | 2 | 9 | import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
// Your code here!
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
while(t-->0)
{
int n=sc.nextInt();
int a[]=new int[n];
... | JAVA |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.