input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
p = list(map(int,input().split()))
count = [0] * n
for i in range(n):
for j in range(i+1):
if p[i] <= p[j]:
count[i] = 1
else:
count[i] = 0
break
print((sum(count))) | n = int(eval(input()))
p = list(map(int,input().split()))
count = 0
p_min = p[0]
for i in range(n):
if p_min >= p[i]:
count+=1
p_min = min(p[i],p_min)
print(count) | p02791 |
import sys
n, *p = list(map(int, sys.stdin.read().split()))
def main():
mi = float('inf')
res = 0
for i in range(n):
if p[i] <= mi:
res += 1
mi = p[i]
return res
if __name__ == '__main__':
ans = main()
print(ans) | import sys
n, *p = list(map(int, sys.stdin.read().split()))
def main():
m = float('inf')
cnt = 0
for x in p:
if x > m: continue
cnt += 1
m = x
print(cnt)
if __name__ == '__main__':
main() | p02791 |
N = int(eval(input()))
P_list = list(map(int, input().split()))
cnt = 0
for i, P in enumerate(P_list):
for tmp_P in P_list[:i+1]:
if P > tmp_P:
break
else:
cnt += 1
print(cnt) | N = int(eval(input()))
P_list = list(map(int, input().split()))
cnt = 0
min_num = P_list[0]
for P in P_list:
if min_num >= P:
cnt += 1
min_num = P
print(cnt) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
count = 0
for i, elem in enumerate(p):
if min(p[:i+1]) == elem:
count += 1
print(count)
| n = int(eval(input()))
p = list(map(int,input().split()))
count = 0
p_min = p[0]
for elem in p:
if elem <= p_min:
count += 1
p_min = elem
print(count)
| p02791 |
N = int(eval(input()))
S = list(map(int,input().split()))
counter = int(0)
tmp = int(0)
breakPoint = int(0)
if N == 1:
print("1")
else:
for i in S:
tmp = tmp + 1
if tmp == 1:
counter = counter + 1
continue
for j in range(0,tmp-1):
if S[j] < i:
breakPoint = 1
break
else:
continue
if breakPoint == 0:
counter = counter + 1
else:
breakPoint = 0
print(counter) | N = int(eval(input()))
S = list(map(int,input().split()))
counter = int(0)
minNum = S[0]
if N == 1:
print("1")
else:
for i in range(N):
if minNum >= S[i]:
minNum = S[i]
counter = counter + 1
print(counter) | p02791 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
p_min = [p[0],] * n
for i in range(1,n):
if p_min[i-1] > p[i]:
p_min[i] = p[i]
else:
p_min[i] = p_min[i-1]
print((sum([1 for i in range(n) if p_min[i] >= p[i]]))) | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
N = int(readline())
P = list(map(int, readline().split()))
cur = N + 1
ans = 0
for x in P:
if cur > x:
ans += 1
cur = x
print(ans)
if __name__ == '__main__':
main()
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(N):
if P[i] == min(P[:i+1]):
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
min = 200007
for i in range(N):
if P[i] < min:
ans += 1
min = P[i]
print(ans) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
x=0
for i in range(N):
B=0
a=P[i]
for j in range(i+1):
b=P[j]
if a>b:
break
else:
B+=1
if i+1==B:
x+=1
print(x) | N=int(eval(input()))
P=list(map(int,input().split()))
x=1
Min=P[0]
for i in range(1,N):
if Min>P[i]:
Min=P[i]
x+=1
print(x) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
result = [False]*N
count = 0
for i in range(N):
flag = True
for j in range(i):
if not P[i] <= P[j]:
flag = False
break
elif result[i] == True:
break
if flag == True:
result[i] = True
count += 1
print(count) | N = int(eval(input()))
P = list(map(int, input().split()))
result = [False]*N
count = 0
mn = P[0]
for i in range(N):
if P[i] <= mn:
count += 1
mn = P[i]
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
for i in range(N):
P_j = P[:i]
if P_j == []:
ans += 1
elif min(P_j) >= P[i]:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int,input().split()))
P_min = [2*(10**5)]
for i in range(N-1):
P_min.append(min(P_min[i],P[i]))
ans = 0
for i in range(N):
if P_min[i] >= P[i]:
ans += 1
print(ans)
| p02791 |
N = int(eval(input()))
p = list(map(int, input().split()))
M = []
for i in range(N):
M.append(min(p[:i+1]))
cnt = 0
for i in range(N):
if p[i]==M[i]:
cnt += 1
print(cnt) | N = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
m = 10**6
for i in p:
if i < m:
m = i
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
P = input().split(" ")
t = 0
list = []
for i in range(N):
list.append(int(P[i]))
m = min(list)
if m == int(P[i]):
t = t + 1
print(t) | N = int(eval(input()))
P = input().split(" ")
t = 1
list = []
for i in range(N):
list.append(int(P[i]))
if i == 0:
m = int(P[0])
elif int(P[i]) < m:
m = int(P[i])
t = t + 1
print(t) | p02791 |
[n] = list(map(int, input().split()))
[*p_list] = list(map(int, input().split()))
count = 0
for i,p in enumerate(p_list):
s_p = p_list[:i+1]
if min(s_p) == p:
count += 1
print(count) | [n] = list(map(int, input().split()))
[*p_list] = list(map(int, input().split()))
count = 0
p_min = 2 * 10 ** 5
for p in p_list:
if p_min >= p:
count += 1
p_min = p
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split( )))
c = 1
m = p[0]
for a in p[1:]:
m = min(m, a)
if m == a:
c += 1
print(c) | n = int(eval(input()))
p = list(map(int, input().split( )))
c = 0
m = p[0]
for i in range(n):
if m >= p[i]:
c += 1
m = p[i]
print(c) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
def smaller(x, y):
if x>y:
return y
else:
return x
def minimum(score):
m = score[0]
for i in range(1, len(score)):
m = smaller(m, score[i])
return m
count = 1
for i in range(1, n):
if p[i]==minimum(p[0:i+1]):
count = count + 1
print(count) | n = int(eval(input()))
p = list(map(int,input().split()))
m=2*(10**5)+1
count = 0
for i in range(0, n):
if p[i] <= m:
m = p[i]
count = count + 1
print(count) | p02791 |
N = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(1,N + 1):
pi = p[i - 1]
if all(pi <= j for j in p[:i]):
count += 1
print(count) | N = int(eval(input()))
p = list(map(int, input().split()))
count = 0
min = p[0]
for i in range(N):
if p[i] <= min:
count += 1
min = p[i]
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(n):
flg = True
for j in range(i):
if p[i] > p[j]:
flg = False
if flg:
count += 1
print(count) | n = int(eval(input()))
p = list(map(int, input().split()))
m = p[0]
count = 1
for i in range(1,n):
if m >= p[i]:
count += 1
m = min(m, p[i])
print(count) | p02791 |
n = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
for i, p in enumerate(P):
if p == min(P[:i + 1]):
cnt += 1
print(cnt)
| n = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
m = P[0]
for p in P:
if m >= p:
cnt += 1
m = p
print(cnt)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 1
for i in range(1, N):
Pi = sorted(P[:i+1])
if Pi[0] >= P[i]:
count += 1
print(count)
| N = int(eval(input()))
P = list(map(int, input().split()))
minimum = N + 1
ans = 0
for i in range(N):
if minimum >= P[i]:
ans += 1
minimum = P[i]
print(ans)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
c = [True for i in range(n)]
for i in range(1,n):
for j in range(i):
if p[i]>p[j]:
c[i] = False
break
print((sum(c))) | n = int(eval(input()))
p = list(map(int, input().split()))
c = [True for i in range(n)]
target = p[0]
for i in range(1,n):
if p[i]>target:
c[i] = False
else:
target = p[i]
print((sum(c))) | p02791 |
N = int(eval(input()))
p = [int(e) for e in input().split(" ")]
c = 0
for i in range(N):
if(p[i] <= min(p[0:i + 1])):
c += 1
print(c) | N = int(eval(input()))
p = [int(e) for e in input().split(" ")]
low = p[0]
c = 0
for i in range(N):
if(p[i] <= low):
c += 1
low = p[i]
print(c) | p02791 |
# coding: utf-8
from sys import stdin
def main():
# コンソール入力を受け取る
N = int(stdin.readline().rstrip())
P = stdin.readline().rstrip().split()
P = [int(i) for i in P]
ans = 0
for i in range(N):
for j in range(i+1):
if P[i] > P[j]:
break
if i == j:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| # coding: utf-8
from sys import stdin
def main():
# コンソール入力を受け取る
N = int(stdin.readline().rstrip())
P = stdin.readline().rstrip().split()
P = [int(i) for i in P]
ans = 1
min = P[0]
for i in range(N-1):
if P[i+1] < min:
ans += 1
min = P[i+1]
print(ans)
if __name__ == '__main__':
main()
| p02791 |
n = int(eval(input()))
l = list(map(int,input().split()))
q = 0
a = 0
for i in l:
a += 1
if i<=min(l[:a]):
q += 1
print(q) | n = int(eval(input()))
l = list(map(int,input().split()))
q = 1
a = l[0]
for i in range(1,n):
a = min(l[i],a)
if l[i]<=a:
q += 1
print(q) | p02791 |
N = int(eval(input()))
p = list(map(int, input().split()))
max0, max1, count = [], 0, 0
for i in p:
max0.append(i)
max1 = i
if max1 == 1:
count += 1
break
elif min(max0) >= max1:
count += 1
print(count)
| N = int(eval(input()))
p = list(map(int, input().split()))
max0, max1, count = p[0], 0, 0
for i in p:
max0 = min(max0, i)
max1 = i
if max1 == 1:
count += 1
break
elif max0 >= max1:
count += 1
print(count)
| p02791 |
n=int(eval(input()))
l1=input().split()
l=[int(x)for x in l1]
ans=0
for i in range(n):
list_now=l[0:i+1]
num_now=l[i]
list_now.sort()
if num_now==list_now[0]:
ans+=1
print(ans)
| n=int(eval(input()))
l=list(map(int, input().split()))
ans=0
min=2*100000
for i in range(n):
num_now=l[i]
if num_now<=min:
ans+=1
min=num_now
print(ans)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
result = 0
for i in range(1,N+1):
if P[i-1]==min(P[:i]):
result += 1
print(result) | N = int(eval(input()))
P = [0] + list(map(int, input().split()))
result = 0
minVal = P[1]
for i in range(1,N+1):
minVal = min(minVal, P[i])
if P[i]==minVal:
result += 1
print(result) | p02791 |
# coding:utf-8
N = int(eval(input()))
P = [int(el) for el in input().split(' ')]
ans = 1
for i, p in enumerate(P):
if i == 0:
continue
flag = True
for j in range(i):
if p > P[j]:
flag = False
if flag:
ans += 1
print(ans) | # coding:utf-8
N = int(eval(input()))
P = [int(el) for el in input().split(' ')]
min_val = N+1
ans = 0
for p in P:
if p < min_val:
ans += 1
min_val = p
print(ans) | p02791 |
import heapq
n = int(eval(input()))
num = [int(i) for i in input().split()]
count1 = 0
for i in range(len(num)):
num1 = num[:i+1].copy()
heapq.heapify(num1)
if heapq.heappop(num1) == num[i]:
count1 += 1
print(count1) | n = int(eval(input()))
num = [int(i) for i in input().split()]
count1 = 0
minv = 0
for i in range(len(num)):
if i ==0:
count1 +=1
minv = num[i]
elif minv >= num[i]:
minv = num[i]
count1 +=1
print(count1) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
ans = 1
d = [1] + [0]*(n-1)
for i in range(1,n):
if (p[i] <= p[i-1] and d[i-1] == 1):
ans += 1
d[i] = 1
elif (d[i-1] ==0 and min(sorted(p[:i+1])) == p[:i+1][-1]):
ans += 1
d[i] = 1
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
m= 10**10
for i in range(n):
tmp = m
m = min(m,p[i])
if tmp != m:
ans += 1
print(ans) | p02791 |
n = int(eval(input()))
lst = list(map(int, input().split()))
cnt = 0
tmp = []
for i in range(len(lst)):
num = lst[i]
tmp.append(num)
if num == min(tmp):
cnt += 1
print(cnt)
| n = int(eval(input()))
lst = list(map(int, input().split()))
cnt = 0
tmp_min = max(lst)
for i in range(len(lst)):
num = lst[i]
if num <= tmp_min:
cnt += 1
tmp_min = num
print(cnt)
| p02791 |
n = int(eval(input()))
seq = [int(e) for e in input().split(' ')]
count = 0
for i in seq:
number_loop = len(seq[0:seq.index(i)+1])
for idx, j in enumerate(seq[0:seq.index(i)+1]):
if i > j:
break
if idx+1 == number_loop:
count += 1
print(count)
| n = int(eval(input()))
seq = [int(e) for e in input().split(' ')]
count = 1
current_min = seq[0]
for idx, i in enumerate(seq[1:]):
if i < current_min:
current_min = i
count += 1
print(count) | p02791 |
n = eval(input())
p = input().split()
i_cnt = 1
current_max = {'idx': 0, 'value': 0}
for j in range(len(p)):
for i in range(current_max['idx'], j):
if current_max['value'] <= int(p[i]):
current_max['idx'] = i
current_max['value'] = int(p[i])
if int(p[i]) < int(p[j]):
break
if j-1 == i:
i_cnt += 1
print(i_cnt) | n = eval(input())
p = input().split()
i_cnt = 1
current_max = {'idx': 0, 'value': 0}
for j in range(len(p)):
for i in range(current_max['idx'], j):
current_max['idx'] = i
if current_max['value'] <= int(p[i]):
current_max['value'] = int(p[i])
if int(p[i]) < int(p[j]):
break
if j-1 == i:
i_cnt += 1
print(i_cnt) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
for i in range(N):
if P[i] == min(P[:i+1]):
count += 1
print(count) | N = int(eval(input()))
P = list(map(int, input().split()))
count = 1
m = P[0]
for i in range(1, N):
if P[i] < m:
m = P[i]
count += 1
print(count) | p02791 |
n = int(eval(input()))
c = list(map(int,input().split(" ")))
ans = 0
for i in range(n):
if c[i] == min(c[:i+1]):
ans += 1
print(ans) | n = int(eval(input()))
c = list(map(int,input().split(" ")))
ans = 0
sai = c[0]
for i in range(n):
if c[i] <= sai:
sai = c[i]
ans += 1
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
# i=1 では必ず成り立つので i>=2 から調べる
s = 1
for i in range(1, N):
flag = True
for j in range(i):
if P[j] < P[i]:
flag = False
break
if flag: s += 1
print(s) | N = int(eval(input()))
p = list(map(int, input().split()))
# 各時点での最小値を求める
m = [0]*(N)
m[0] = p[0]
for i in range(N-1):
m[i+1] = min(m[i], p[i+1])
ans = 1
for i in range(1, N):
if m[i-1] > p[i]: ans += 1
print(ans) | p02791 |
N = int(eval(input()))
p = list(map(int, input().split()))
# 条件はN=O(10^5)より、本問はO(N)で解けるはず
# 二重ループをすると、O(N^2)で間に合わない
# 累積和の問題（ABC-154-Dとか）と同じ発想が使える！
# 具体的にO(N)で解くために、最初に各iに対して、i番目までの最小値を求めておく
m = [0]*(N)
m[0] = p[0]
for i in range(N-1):
m[i+1] = min(m[i], p[i+1])
# 各iまでの最小値とi番目の値を比較し、最小値の方が大きければよい
ans = 1
for i in range(1, N):
if m[i-1] >= p[i]: ans += 1
print(ans) | N = int(eval(input()))
p = list(map(int, input().split()))
# 条件はN=O(10^5)よりO(N)で解く
# 二重ループをすると、O(N^2)で間に合わない
# 累積和の問題（ABC-154-Dとか）と同じ発想が使える！
# 具体的にO(N)で解くために、最初に各iに対して、i番目までの最小値を求めておく
m = [0]*(N)
m[0] = p[0]
for i in range(1, N):
m[i] = min(m[i-1], p[i])
# 各iまでの最小値とi番目の値を比較し、最小値の方が大きければよい
ans = 1
for i in range(1, N):
if m[i-1] >= p[i]: ans += 1
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
before_hairetsu = [N+1] * N
#i_before = N + 1
before_hairetsu[0] = N + 1
for i in range(N):
if(min( min(before_hairetsu) , P[i]) >= P[i]):
cnt += 1
#i_before = P[i]
before_hairetsu.append( P[i] )
print(cnt)
| N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
maxmax = max(P) + 1
for i in range(N):
if( maxmax > P[i]):
cnt += 1
maxmax = P[i]
print(cnt)
| p02791 |
def main():
N = int(eval(input()))
P = [int(i) for i in input().split()]
key = P[0]
ans = 0
for p in P:
if p <= key:
key = p
ans += 1
print(ans)
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
m = 10**6
ans = 0
for a in A:
if a <= m:
m = a
ans += 1
print(ans)
if __name__ == '__main__':
main()
| p02791 |
n = int(eval(input()))
list = list(map(int,input().split()))
count = 0
slist = []
for i in range(0,n):
slist.append(list[i])
if min(slist) == list[i]:
count += 1
else:
pass
print(count) | n = int(eval(input()))
xlist = list(map(int,input().split()))
count = 0
minn = xlist[0]
for i in range(0,n):
if minn >= xlist[i]:
count += 1
minn = xlist[i]
else:
pass
print(count) | p02791 |
N = int(eval(input()))
p_list = list(map(int, input().split()))
j = 1
temp = p_list[0]
for i in range(1,N):
if p_list[i] > temp:
continue
if p_list[i] <= min(p_list[0:i+1]):
j = j + 1
else:
temp = p_list[i]
print(j) | N = int(eval(input()))
p_list = list(map(int, input().split()))
j = 1
temp = p_list[0]
for i in range(1,N):
if temp >= p_list[i]:
j += 1
temp = min(temp,p_list[i])
print(j) | p02791 |
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
numbers=[]
n = int(eval(input()))
numbers=list(map(int,input().split()))
count=0
for idx,data in enumerate(numbers):
if idx == 0:
count+=1
elif min(numbers[0:idx+1])==data:
count+=1
else:
continue
print(count)
if __name__=="__main__":
main() | #-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
numbers=[]
n = int(eval(input()))
numbers=list(map(int,input().split()))
small=0
dp=[]
for idx,data in enumerate(numbers):
if idx == 0:
small=data
dp.append(data)
elif data < small:
small=data
dp.append(data)
else:
continue
print((len(dp)))
if __name__=="__main__":
main() | p02791 |
n = int(eval(input()))
p_list = list(map(int, input().split()))
ans = 0
for i in range(n):
if p_list[i] <= min(p_list[:i+1]):
ans += 1
print(ans)
| n = int(eval(input()))
p_list = list(map(int, input().split()))
ans = 0
now_min = p_list[0]
for i in range(n):
if now_min > p_list[i]:
now_min = p_list[i]
if p_list[i] <= now_min:
ans += 1
print(ans)
| p02791 |
n=int(eval(input()))
P=list(map(int,input().split()))
Q=[]
ans = 0
for i in range(n):
Q.append(P[i])
if P[i] == min(Q):
ans += 1
print(ans) | n=int(eval(input()))
P=list(map(int,input().split()))
x=float("inf")
ans = 0
for i in range(n):
if x > P[i]:
ans += 1
x = P[i]
print(ans) | p02791 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = 0
for x in range(len(a)):
c = 0
for y in range (x):
if a[y] < a[x]:
c +=1
if c == 0:
b+=1
print(b)
| n = int(eval(input()))
a = list(map(int,input().split()))
b = 0
mini = 2*(10**5)+10
for x in range(len(a)):
if a[x] < mini :
mini=a[x]
b+=1
print(b)
| p02791 |
n = int(eval(input()))
p_list = list(map(int, input().split()))
ans = 1
for i in range(1, n):
if all([p_list[i] <= p_list[j] for j in range(i)]):
ans += 1
print(ans)
| n = int(eval(input()))
p_list = list(map(int, input().split()))
ans = 1
min = p_list[0]
for i in range(1, n):
if min >= p_list[i]:
ans += 1
min = p_list[i]
print(ans)
| p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
cnt=0
list=[]
for i in range(n):
list.append(p[i])
if min(list)==p[i]:
cnt+=1
print(cnt) | n=int(eval(input()))
p=list(map(int,input().split()))
cnt=0
tiny=float('inf')
for i in range(n):
if tiny>=p[i]:
cnt+=1
tiny=p[i]
else:
pass
print(cnt) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
cnt=0
tiny=float('inf')
for i in range(n):
if tiny>=p[i]:
cnt+=1
tiny=p[i]
else:
pass
print(cnt) | n=int(eval(input()))
p=list(map(int,input().split()))
cnt=0
tiny=float('inf')
for i in range(n):
if tiny>=p[i]:
cnt+=1
tiny=p[i]
print(cnt) | p02791 |
import sys
N, = list(map(int, input().split()))
P = list ( map(int, input().split()) )
answer = 0
for i in range(N):
flag = True;
for j in range(i):
if P[i] > P[j]:
flag = False
if flag:
answer += 1
print (answer) | import sys
N, = list(map(int, input().split()))
P = list ( map(int, input().split()) )
answer = 0
prevMin = 2 ** 32
for i in range(N):
if P[i] <= prevMin:
answer += 1
prevMin = P[i]
print (answer) | p02791 |
N = int(eval(input()))
P = [int(i) for i in input().split()]
cnt = 0
for i in range(1, N + 1):
target = P[:i]
if target[-1] == min(target):
cnt += 1
print(cnt) | N = int(eval(input()))
P = [int(i) for i in input().split()]
cnt = 0
min_num = P[0]
for num in P:
if num == min_num:
cnt += 1
elif num < min_num:
cnt += 1
min_num = num
print(cnt) | p02791 |
n = int(eval(input()))
P = list(map(int, input().split()))
counter = 0
for i in range(n):
for j in range(i):
if P[i] > P[j]:
break
else:
counter += 1
print(counter) | n = int(eval(input()))
P = list(map(int, input().split()))
min_val = P[0]
counter = 0
for i in range(n):
min_val = min(P[i], min_val)
if min_val == P[i]:
counter += 1
print(counter) | p02791 |
N=int(eval(input()))
P=[int(i) for i in input().split()]
num = 0
#print(min(P[:1]))
for k in range(0,N):
if min(P[:k+1]) == P[k]:
num+=1
print(num) | num = int(eval(input()))
A = list(map(int, input().split()))
a_min = 200001
count = 0
for a in A:
if a < a_min:
count += 1
a_min = a
print(count)
| p02791 |
n=int(eval(input()))
P=list(map(int,input().split()))
lst_con=[P[0]]
lst_num=[0]
s=0
for i in range(n):
x=P[i]
flag=True
if x>lst_con[-1]:
flag=False
else:
for j in range(lst_num[-1],i):
if P[j]<x:
flag=False
break
if flag:
s+=1
print(s)
| n=int(eval(input()))
lst=list(map(int,input().split()))
premin=lst[0]
ans=0
for x in lst:
if premin>=x:
ans+=1
premin=x
print(ans)
| p02791 |
N=int(eval(input()))
p=list(map(int, input().split()))
cnt=0
for i in range(N):
min=p[0]
for j in range(i):
if min>=p[j]:
min=p[j]
if p[i]<=min:
cnt+=1
print(cnt) | N=int(eval(input()))
p=list(map(int, input().split()))
cnt=0
min=p[0]
for i in range(N):
if p[i]<=min:
min=p[i]
cnt+=1
print(cnt) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
ans=1
for i in range(1,N):
if P[i]<=min(P[:i]):
ans+=1
print(ans) | N=int(eval(input()))
P=list(map(int,input().split()))
ans=0
val=P[0]
for i in range(N):
if val>=P[i]:
ans+=1
val=P[i]
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
t = []
c = 0
for i in p:
t += [i]
if i <= min(t):
c += 1
print(c)
| n = int(eval(input()))
p = list(map(int, input().split()))
t = n
c = 0
for i in range(n):
t = min(t, p[i])
if p[i] <= t:
c += 1
print(c)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
flag = True
for i in range(1, N):
for j in range(i-1, -1, -1):
if P[j] < P[i]:
flag = False
if not flag:
flag = True
else:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
mi = N
for i in range(N):
mi = min(mi, P[i])
if mi == P[i]: ans += 1
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
a=[]
for i in range(n):
if p[i] == min (p[:i+1]):
a.append(p[i])
print((len(a))) | n = int(eval(input()))
p = list(map(int,input().split()))
ans=0
m=[]
m.append(p[0])
for i in range(1,n):
m.append(min(p[i],m[i-1]))
for i , j in zip(p,m):
if i <= j:
ans+=1
print(ans)
| p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
a=p[0]
cnt=1
for i in p:
if i<a:
cnt+=1
a=i
if i==1:
break
print(cnt) | n=int(eval(input()))
p=list(map(int,input().split()))
a=p[0]
cnt=1
for i in p:
if i<a:
cnt+=1
a=i
print(cnt) | p02791 |
n = int(eval(input()))
all_number = input().split()
count = 0
for i in range(n):
check = True
for j in range(i):
if(int(all_number[i]) > int(all_number[j])):
check = False
break
if(check):
count = count + 1
print(count) | n = int(eval(input()))
all_number = input().split()
count = 0
lowest = int(all_number[0])
for i in range(n):
if(int(all_number[i]) <= lowest):
count = count + 1
lowest = int(all_number[i])
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n):
s = min(p[:i+1])
if p[i] <= s:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
s = 10**18
ans = 0
for i in range(n):
s = min(s, p[i])
if p[i] <= s:
ans += 1
print(ans) | p02791 |
N = int(eval(input()))
P=list(map(int, input().split()))
ans_r=0
for p in range(0, N):
for q in range(0, p):
if (P[p] > P[q]):
ans_r += 1
break
print((N-ans_r))
| N = int(eval(input()))
P=list(map(int, input().split()))
ans_r=0
min_num=P[0]
for p in range(0, N):
if (min_num > P[p]):
min_num=P[p]
if (min_num < P[p]):
ans_r += 1
print((N-ans_r))
| p02791 |
n = int(eval(input()))
an = [int(i) for i in input().split()]
lowe, an_sub = 0, []
for i in range(0, n):
an_sub = an[0:i + 1]
if an_sub[i] <= min(an_sub):
lowe += 1
print(lowe) | n = int(eval(input()))
an = [int(i) for i in input().split()]
lowe, min_an_sub = 0, an[0]
an_sub = []
for i in range(0, n):
an_sub.append(an[i])
min_an_sub = min(min_an_sub, an[i])
if an_sub[i] <= min_an_sub:
lowe += 1
print(lowe) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
min_sp, cnt = p[0], 0
for i in range(n):
if p[i] <= min_sp:
cnt += 1
min_sp = p[i]
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split()))
min_sp, cnt = p[0], 0
for pi in p:
if pi <= min_sp:
cnt += 1
min_sp = pi
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
for i in range(N):
flag = True
for j in range(i):
if P[i] > P[j]:
flag = False
break
if flag:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
minx = 10**9
for i in range(N):
if minx > P[i]:
ans += 1
minx = P[i]
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
s = 0
for i in range(N):
if P[i] == min(P[0:i+1]):
s += 1
print(s) | N = int(eval(input()))
A = list(map(int, input().split()))
s = 0
P = (A[0:N])
Q = A
for i in range(N-1):
if Q[i] < Q[i+1]:
Q[i+1] = Q[i]
for i in range(N):
if P[i] == Q[i]:
s += 1
print(s) | p02791 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
bit = 0
for i in range(n):
kkk = ( 1<<(a[i]-1) ) -1
if bit&kkk == 0:
ans += 1
bit += 1<<(a[i]-1)
print(ans)
| n = int(eval(input()))
a = list(map(int,input().split()))
mini = 10**9
ans = 0
for i in range(n):
if a[i] < mini:
ans += 1
mini = a[i]
print(ans)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
for i in range(1, N):
if P[i] <= min(P[:i]):
ans += 1
print(ans)
| N = int(eval(input()))
P = list(map(int, input().split()))
'''
参考
https://cocoinit23.com/abc152/
すべての(i, j)を調べていると制限時間を超過してしまう。
listの2つ目の要素(index=1)から順に見ていって、最小値が更新されたら解をカウントアップする。
ただし、解の最小値は常に1となるので、解の初期値は1にしておくこと。
'''
ans = 1
min_p = P[0]
for i in range(1, N):
if P[i] <= min_p:
min_p = P[i]
ans += 1
print(ans)
| p02791 |
N = int(eval(input()))
num = list(map(int,input().split()))
cnt = 0
flag = False
for i in range(N):
if(i == 0):
cnt+=1
continue
sub = num[0:i]
sub_min = min(sub)
if (num[i] <= sub_min):
cnt+=1
print(cnt) | N = int(eval(input()))
num = list(map(int,input().split()))
cnt = 0
flag = False
num_min = 10**8
for i in range(N):
if(i == 0):
cnt+=1
continue
num_min = min(num_min,num[i-1])
if (num[i] <= num_min):
cnt+=1
print(cnt) | p02791 |
N = int(eval(input()))
L = list(map(int,input().split()))
ans = 1
for i in range(1,N):
Pj = min(L[:i])
Pi = L[i]
if Pj > Pi:
ans += 1
print(ans) | import sys
read = sys.stdin.buffer.read#全部読み込むやつ
readline = sys.stdin.buffer.readline#1行読み込むやつ
readlines = sys.stdin.buffer.readlines#リストで読み込むらしい
N,*L = list(map(int,read().split()))
ans = 0
Pj = L[0]
for i in L:
Pj = min(Pj,i)
if Pj >= i:
ans += 1
print(ans)
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
m = n
q = []
for i in range(n):
q.append(p[i])
if not p[i] <= min(q):
m -= 1
print(m) | n = int(eval(input()))
p = list(map(int,input().split()))
m = n
q = 2 * (10 ** 5)
for i in range(n):
q = min(p[i],q)
if not p[i] <= q:
m -= 1
print(m) | p02791 |
N = int(eval(input()))
lstP = list(map(int, input().split()))
count = 0
for i in range(0, len(lstP)):
lstT = lstP[0:i+1]
if min(lstT) == lstP[i]:
count = count + 1
print(count) | N = int(eval(input()))
lstP = list(map(int, input().split()))
count = 1
minval = lstP[0]
for i in range(1, len(lstP)):
val = lstP[i]
if val <= minval:
minval = val
count += 1
print(count)
| p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
for i in range(N):
for j in range(i):
f = True
if P[i] >= P[j]:
f = False
break
else:
ans += 1
print (ans)
| N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
m_n = N
for i in range(N):
if m_n >= P[i]:ans += 1
m_n = min(m_n,P[i])
print (ans) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
cnt = 0
for i in range(1,N+1):
if min(P[:i]) == P[i-1]:
cnt += 1
print(cnt) | N = int(eval(input()))
P = list(map(int,input().split()))
mi = P[0]
cnt = 1
for i in range(1,N):
if P[i] <= mi:
mi = P[i]
cnt += 1
print(cnt) | p02791 |
from itertools import accumulate
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
"""
for i, p in enumerate(P):
# if np.any(P[0:i] < p): あまり以下と変わらなかった
# if any([True for p2 in P[0:i] if p2 < p]): # 2回のループが☓ O(n^2)なので
pass
else:
ans += 1
"""
for i, p in enumerate(P):
tmp = list(accumulate(P[0:i+1], min))[-1]
if p <= tmp:
ans += 1
print(ans)
| from itertools import accumulate
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
"""
for i, p in enumerate(P):
# if np.any(P[0:i] < p): あまり以下と変わらなかった
# if any([True for p2 in P[0:i] if p2 < p]): # 2回のループが☓ O(n^2)なので
pass
else:
ans += 1
"""
P_min = list(accumulate(P, min))
for p, p_min in zip(P, P_min):
if p == p_min:
ans += 1
print(ans) | p02791 |
n = int(eval(input()))
p_list = list(map(int, input().split(" ")))
count = 0
for i in range(n):
for j in range(i+1):
if p_list[i] > p_list[j]:
break
else:
count += 1
print(count)
| n = int(eval(input()))
p_list = list(map(int, input().split(" ")))
count = 0
minimum = 10000000
for i in p_list:
if(i <= minimum):
minimum = i
count += 1
print(count)
| p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
result = 0
nowmin = P[0]
for i in range(N):
if P[i]>nowmin:
pass
else:
if P[i] == min(P[:i+1]):
result += 1
nowmin == P[i]
print(result) | N = int(eval(input()))
P = list(map(int,input().split()))
result = 0
nowmin = N
for i in range(N):
if P[i]>nowmin:
pass
else:
result += 1
nowmin = P[i]
print(result) | p02791 |
n = int(eval(input()))
p = input().split()
cnt = 0
for i in range(n):
ng_flg = 0
ii = i
for j in range(ii+1):
if int(p[j]) < int(p[ii]) :
ng_flg=1
break
if ng_flg == 0:
cnt +=1
print(cnt) | n = int(eval(input()))
p = input().split()
min = int(p[0])
cnt = 0
for i in range(n):
if int(p[i]) <= min:
cnt+=1
if int(p[i])<min :
min = int(p[i])
print(cnt) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
plist = []
for i in range(n):
plist.append(p[:i + 1])
count = 0
minn = n
for j in range(n):
for k in plist[j]:
if minn >= k:
minn = k
if minn >= p[j]:
count += 1
print(count) | n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
minn = n
for j in range(len(p)):
if minn >= p[j]:
minn = p[j]
count += 1
print(count) | p02791 |
N = int(eval(input()))
p_list = list(map(int, input().split()))
count = 0 # p_j > p_i である回数
p_length = len(p_list)
for i in range(p_length):
p_max = min(p_list[:i+1])
if p_list[i]==p_max:
count = count + 1
print(count)
| N = int(eval(input()))
p_list = list(map(int, input().split()))
count = 0 # p_j > p_i である回数
p_length = len(p_list)
p_min = p_list[0] # 現時点での最小値
for i in range(p_length):
if p_list[i]<=p_min:
p_min = p_list[i]
count = count + 1 # カウントを１つ増やす
else:
continue
print(count)
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
for i in range(n):
m = min(p[0:i+1])
if m >= p[i]:
cnt += 1
print(cnt) | n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
m = p[0]
for i in range(n):
if m >= p[i]:
cnt += 1
m = p[i]
print(cnt) | p02791 |
#n = int(input())
#l = list(map(int, input().split()))
'''
A=[]
B=[]
for i in range():
a, b = map(int, input().split())
A.append(a)
B.append(b)'''
n = int(eval(input()))
p = list(map(int, input().split()))
mi = 1000000000
cnt = 0
for i in range(n):
if p[i] <= mi:
cnt += 1
if mi > p[i]:
mi = p[i]
print(cnt)
| #n = int(input())
#l = list(map(int, input().split()))
'''
A=[]
B=[]
for i in range():
a, b = map(int, input().split())
A.append(a)
B.append(b)'''
def main():
n = int(eval(input()))
p = list(map(int, input().split()))
mi = 1000000000
cnt = 0
for i in range(n):
if p[i] <= mi:
cnt += 1
if mi > p[i]:
mi = p[i]
print(cnt)
main() | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
p_min = 100000
for i in range(n):
pi = p[i]
if i >= 1:
p_min = min(p[:i])
if pi <= p_min:
cnt += 1
print(cnt)
| n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
p_min = p[0]
for i in range(n):
pi = p[i]
if pi <= p_min:
cnt += 1
p_min = pi
print(cnt)
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
for i in range(n):
state = 1
for j in range(i):
if p[i]<=p[j]:
state = 1
else:
state = 0
break
if state == 1:
cnt+=1
print(cnt) | n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 1
max_p = p[0]
for i in range(1,n):
if max_p > p[i]:
max_p = p[i]
cnt+=1
print(cnt)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(1, len(P)+1):
M = min(P[:i])
if P[i-1] == M:
ans = ans +1
print(ans) | N = int(eval(input()))
P = list(map(int,input().split()))
m = float("inf")
count = 0
for i in P:
if m > i:
m = i
if m == i:
count += 1
print(count) | p02791 |
n=int(eval(input()))
B=list(map(int,input().split()))
cnt=0
for i in range(n):
if min(B[:i+1])==B[i]:
cnt+=1
print(cnt) | n=int(eval(input()))
B=list(map(int,input().split()))
cnt=0
maxi=max(B)
for i in range(n):
if maxi>=B[i]:
cnt+=1
maxi=B[i]
print(cnt) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
m =[0] * n
m[0] = p[0]
for i in range(1, n):
q = sorted(p[:i+1])
m[i] = q[0]
ans = 0
for i in range(n):
if p[i] == m[i]:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
m =[0] * n
m[0] = p[0]
mi = m[0]
for i in range(1, n):
mi = min(mi, p[i])
m[i] = mi
ans = 0
for i in range(n):
if p[i] == m[i]:
ans += 1
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n):
if p[i] <= min(p[0:i+1]):
ans += 1
print(ans)
| n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
p_min = p[0]
for i in range(n):
if p[i] <= p_min:
ans += 1
p_min = p[i]
print(ans)
| p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
ans_count=N
for i in range(1,N):
if(P[i]>=min(P[:i])):
ans_count-=1
print(ans_count)
| N = int(eval(input()))
P = list(map(int,input().split()))
minP = P[0]
ans = 1
for i in P[1:]:
if(i<=minP):
minP = i
ans += 1
print(ans)
| p02791 |
from sys import stdin
def main():
n = int(stdin.readline())
p = list(map(int, stdin.readline().split()))
ans = 0
min = p[0]
for i in p:
if i <= min:
ans += 1
min = i
print(ans)
if __name__ == "__main__":
main()
| from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n = int(eval(input()))
p = list(map(int, input().split()))
min = p[0]
ans = 1
for i in range(1, n):
if p[i] <= min:
min = p[i]
ans += 1
print(ans)
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
for i in range(0, N):
p_i = P[i]
for j in range(0, i):
if p_i > P[j]:
break
else:
count += 1
print(count) | N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
leftmin = P[0]
for i in range(0, N):
if leftmin >= P[i]:
count += 1
if leftmin > P[i]:
leftmin= P[i]
print(count) | p02791 |
import math
n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
for i in range(n):
now_list = p[0:i+1]
Pi = p[i]
Pj = min(now_list)
#print(now_list,Pi,Pj)
if Pi > Pj:
cnt += 1
print((n-cnt))
| import math
n = int(eval(input()))
p = list(map(int,input().split()))
temp = 11111111111111111
cnt = 0
for i in p:
temp = min(temp,i)
if temp >= i:
cnt += 1
print(cnt)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
l = []
m = [P[0]]
for i in range(N):
if P[i] <= min(m):
m.append(P[i])
continue
else:
l.append(i)
print((N - len(l))) | N = int(eval(input()))
P = list(map(int, input().split()))
l = []
a = P[0]
for i in range(N):
if P[i] <= a:
a = P[i]
continue
else:
l.append(i)
print((N - len(l))) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
l = []
a = P[0]
for i in range(N):
if P[i] <= a:
a = P[i]
continue
else:
l.append(i)
print((N - len(l))) | N = int(eval(input()))
P = list(map(int, input().split()))
l = 0
a = P[0]
for p in P:
if p <= a:
a = p
l += 1
continue
print(l) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
count = 0
for i in range(n):
ans = p[:i+1]
if min(ans) != p[i]:
count += 1
print((n-count)) | n = int(eval(input()))
p = list(map(int,input().split()))
count = 0
mi = n+1
for i in range(n):
mi = min(mi,p[i])
if mi == p[i]:
count += 1
print(count) | p02791 |
n = int(eval(input()))
ps = list(map(int, input().split()))
m = 1
fps = []
for i in range(1, n):
fps.append(ps[i-1])
if min(fps) > ps[i]:
m += 1
print(m) | n = int(eval(input()))
ps = list(map(int, input().split()))
fps = [ps[0]]
for i in range(1,n):
if fps[len(fps)-1] > ps[i]:
fps.append(ps[i])
print((len(fps))) | p02791 |
N, *D = [list(map(int, s.split())) for s in open(0)]
N, D = N[0], D[0]
cnt = 1
min_v = D[0]
for i in range(1, len(D)):
if min_v >= D[i]:
cnt += 1
min_v = D[i]
print(cnt) | def main():
_ = int(eval(input()))
A = list(map(int, input().split()))
min_value = 1e10
cnt = 0
for a in A:
if a <= min_value:
min_value = a
cnt += 1
print(cnt)
if __name__ == "__main__":
main() | p02791 |
import queue
import copy
import math
from collections import deque
# そのまま入力文字列の入力
n = int(eval(input()))
# 空白区切りの数値をリスト化
pn = list(map(int, input().split()))
ans = 0
for i in range(0, n):
if i == 0:
ans += 1
continue
all_small = True
for j in range(i, -1, -1):
if pn[i] <= pn[j]:
continue
else:
all_small = False
break
if all_small:
ans += 1
print(ans) | import queue
import copy
import math
from collections import deque
# そのまま入力文字列の入力
n = int(eval(input()))
# 空白区切りの数値をリスト化
pn = list(map(int, input().split()))
ans = 0
current_min = n + 1
for i in range(0, n):
if i == 0:
current_min = pn[i]
ans += 1
continue
if pn[i] < current_min:
ans += 1
current_min = pn[i]
continue
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
class Node:
def __init__(self, data):
self.left = None
self.right = None
self.data = data
def insert(self, data):
if self.data:
if data < self.data:
if self.left is None:
self.left = Node(data)
else:
self.left.insert(data)
elif data > self.data:
if self.right is None:
self.right = Node(data)
else:
self.right.insert(data)
else:
self.data = data
def PrintTree(self):
if self.left:
return self.left.PrintTree() + 1
else:
return 1
root = Node(P[0])
for i in range(1, len(P)):
root.insert(P[i])
print((root.PrintTree())) | N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 1
min_p = P[0]
for i in range(1, len(P)):
if P[i] < min_p:
cnt += 1
min_p = P[i]
print(cnt) | p02791 |
def main():
from sys import stdin, setrecursionlimit
#setrecursionlimit(10**9)
n = int(stdin.readline()[:-1])
r = stdin.readline()[:-1]
#n = int(stdin.readline()[:-1])
#r = [stdin.readline() for i in range(n)]
#t = [int(stdin.readline()) for i in range(n)]
a = list(map(int, r.split()))
#a, b = map(int, r.split())
#a = [int(s[i]) for i in range(1, n+1)]
#a = [list(map(int, r.split())) for i in range(1,n+1)]
ma = max(a)
mi = min(a)
res = a.count(mi)
d = [i for i in a if ma != i or mi != i]
for i in range(1,len(d)):
b = a[:i]
if min(b) >= a[i]:
res += 1
print(res)
#'Yes', 'No', 'YES', 'NO', ':(', 'Yay!'
#res = 0
#a, b = map(int, r.split())
#print()
if __name__ == '__main__':
main()
| def main():
from sys import stdin, setrecursionlimit
#setrecursionlimit(10**9)
n = int(stdin.readline()[:-1])
r = stdin.readline()[:-1]
#n = int(stdin.readline()[:-1])
#r = [stdin.readline() for i in range(n)]
#t = [int(stdin.readline()) for i in range(n)]
a = list(map(int, r.split()))
#a, b = map(int, r.split())
#a = [int(s[i]) for i in range(1, n+1)]
#a = [list(map(int, r.split())) for i in range(1,n+1)]
res = 1
bk = a[0]
for i in range(1,n):
if bk >= a[i]:
bk = a[i]
res += 1
print(res)
# b = [0]*n
# for i in range(n):
# b[a[i]-1] = i
# res = 0
# mem = b[0]
# for i in range(1,n):
# if mem <= b[i]:
# print(b[i])
## mem = b[i]
# else:
# res += 1
# print(res)
if __name__ == '__main__':
main()
| p02791 |
N = int(eval(input()))
P_ls = list(map(int, input().split(' ')))
rst = 0
for i in range(N):
val = P_ls[i]
if min(P_ls[: i + 1]) == val:
rst += 1
print(rst) | N = int(eval(input()))
P_ls = list(map(int, input().split(' ')))
rst, min_val = 0, 10 ** 6
for i in P_ls:
if min_val >= i:
rst += 1
min_val = i
print(rst) | p02791 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.