input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n=int(eval(input()))
s=list(map(int,input().split()))
c=0
for i in range(n):
f=True
for j in range(0,i+1):
if s[i-j]<s[i]:
f=False
break
if f:
c=c+1
print(c) | n=int(eval(input()))
s=list(map(int,input().split()))
c=0
m=200001
for i in range(n):
if m>s[i]:
c=c+1
m=min(m,s[i])
print(c) | p02791 |
n=int(eval(input()))
list1=list(map(int,input().split()))
list2=[i for i in list1 if i<=list1[0]]
ln=[list1[0]]
for i in list2:
if min(ln)>=i:
ln.append(i)
print((len(ln)-1)) | n=int(eval(input()))
list1=list(map(int,input().split()))
mi=list1[0]
c=0
for i in list1:
if mi>=i:
mi=i
c+=1
print(c) | p02791 |
#!/usr/bin/env python3
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
for i in range(0, N):
P_i = P[i]
P_j = P[0:i+1]
if P_i == min(P_j):
cnt += 1
print(cnt) | #!/usr/bin/env python3
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
tmp = 10 ** 10
for i in range(N):
if tmp >= P[i]:
cnt += 1
tmp = min(tmp, P[i])
print(cnt) | p02791 |
n = int(eval(input()))
a = list(map(int,input().split()))
cnt=1
for i in range(1,n):
j = i-1;flag=0
#print(i)
while j>=0:
if a[i]>a[j]:
flag=1
break
j-=1
if flag==0:
cnt+=1
print(cnt)
| n = int(eval(input()))
a = list(map(int,input().split()))
cnt=1;small=a[0]
for i in range(1,n):
if a[i]<=small:
#print(a[i],'--',large)
cnt+=1
small=a[i]
print(cnt)
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
count = 1
for i in range(1,n):
if p[i] == min(p[0:(i+1)]):
count += 1
print(count) | n = int(eval(input()))
p = list(map(int,input().split()))
count = 1
min_p = p[0]
for i in range(n):
if min_p > p[i]:
count += 1
min_p = p[i]
print(count) | p02791 |
n = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
for i in range(len(P)):
if min(P[0:i+1]) == P[i]:
ans += 1
else:
pass
print(ans) | n = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
tmp = P[0]
for i in range(n):
if P[i] <= tmp:
ans += 1
tmp = P[i]
else:
pass
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
a = 0
s = 10**6
for p in P:
if p<s:
a+=1
s = min(s,p)
print(a) | N = int(eval(input()))
P = list(map(int,input().split()))
a = 0
s = 10**6
for p in P:
if p<s:
a+=1
s=p
print(a) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
for i in range(1, N):
if min(P[:i]) >= P[i]:
ans += 1
print(ans)
| N = int(eval(input()))
P = list(map(int, input().split()))
# N = 5
# P = [4, 2, 5, 1, 3]
ans = 0
min = 2 * 10**5
for i in range(0, N):
# i = 1
if min > P[i]:
min = P[i]
if P[i] <= min:
ans += 1
print(ans) | p02791 |
n = int(eval(input()))
l = list(map(int,input().split()))
count = 0
for i in range(n):
if min(l[:i+1]) == l[i]:
count += 1
print(count) | n = int(eval(input()))
l = list(map(int,input().split()))
m = l[0]
count = 1
for i in range(1,n):
if m > l[i]:
count += 1
m = l[i]
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
c = 0
for i in range(N):
flag = 1
for j in range(i):
if P[j] < P[i]:
flag = 0
break
if flag:
c += 1
print(c) | N = int(eval(input()))
P = list(map(int, input().split()))
c = 0
for i in range(N - 1):
f = P[i]
l = P[i + 1]
if f < l:
P[i] = l
P[i+1] = f
c += 1
print((N - c)) | p02791 |
N = int(eval(input()))
P = [int(n) for n in input().split()]
c = 0
o = sorted([i for i in range(1, N+1)], reverse=True)
if o==P:
print(N)
else:
while P:
r = min(P)
P = P[:P.index(r)]
c += 1
print(c)
| N = int(eval(input()))
P = [int(n) for n in input().split()]
c = 0
curr = 2*10**5+1
for p in P:
if p < curr:
curr = p
c += 1
print(c)
| p02791 |
n=int(eval(input()))
lists=list(map(int,input().split()))
mn=n+1
cnt=0
for li in lists:
if mn>li:
mn=li
cnt+=1
print(cnt) | n=int(eval(input()))
P=list(map(int,input().split()))
mn=2*10**5+1
cnt=0
for item in P:
if mn>item:
cnt+=1
mn=item
print(cnt) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
c = 1
for i in range(n):
if(i != 0 and sum([p[i] <= x for x in p[:i]]) == i):
c += 1
print(c) | n = int(eval(input()))
p = list(map(int, input().split()))
MIN = 10e5
c = 0
for i in range(n):
if p[i] <= MIN:
MIN = p[i]
c += 1
print(c) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
# print(N, l)
# Pi < Pj
result = []
r = False
for i in range(1, N+1):
count = 0
for j in range(0, i):
if P[i - 1] <= P[j]:
count += 1
else:
break
if count >= i:
result.append(i)
print((len(set(result))))
| N = int(eval(input()))
P = list(map(int, input().split()))
result = 0
m = P[0]
for i in range(N):
if P[i] <= m:
result += 1
m = P[i]
print(result) | p02791 |
# -*- coding: utf-8 -*-
import io
import sys
import math
def solve(n, p_lst):
# implement process
xmin = p_lst[0]
cnt = 0
for x in p_lst:
if x <= xmin:
cnt+=1
xmin = x
return cnt
def main():
# input
n = int(eval(input()))
p_lst = list(map(int, input().split()))
# process
ans = str( solve(n, p_lst ) )
# output
print(ans)
return ans
### DEBUG I/O ###
_DEB = 0 # 1:ON / 0:OFF
_INPUT = """\
1
1
"""
_EXPECTED = """\
3
"""
def logd(str):
"""usage:
if _DEB: logd(f"{str}")
"""
if _DEB: print(f"[deb] {str}")
### MAIN ###
if __name__ == "__main__":
if _DEB:
sys.stdin = io.StringIO(_INPUT)
print("!! Debug Mode !!")
ans = main()
if _DEB:
print()
if _EXPECTED.strip() == ans.strip(): print("!! Success !!")
else: print(f"!! Failed... !!\nANSWER: {ans}\nExpected: {_EXPECTED}") | # -*- coding: utf-8 -*-
import io
import sys
import math
def solve(n, p_lst):
# implement process
xmin = p_lst[0]
cnt = 0
for x in p_lst:
if x <= xmin:
cnt+=1
xmin = x
if xmin == 1:
break
return cnt
def main():
# input
n = int(eval(input()))
p_lst = list(map(int, input().split()))
# process
ans = str( solve(n, p_lst ) )
# output
print(ans)
return ans
### DEBUG I/O ###
_DEB = 0 # 1:ON / 0:OFF
_INPUT = """\
1
1
"""
_EXPECTED = """\
3
"""
def logd(str):
"""usage:
if _DEB: logd(f"{str}")
"""
if _DEB: print(f"[deb] {str}")
### MAIN ###
if __name__ == "__main__":
if _DEB:
sys.stdin = io.StringIO(_INPUT)
print("!! Debug Mode !!")
ans = main()
if _DEB:
print()
if _EXPECTED.strip() == ans.strip(): print("!! Success !!")
else: print(f"!! Failed... !!\nANSWER: {ans}\nExpected: {_EXPECTED}") | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
num = 1
for i in range(1,N):
flag = 0
min_i = min(P[:i])
if min_i >= P[i]:
num += 1
print(num) | N = int(eval(input()))
P = list(map(int,input().split()))
num = 1
min_P = P[0]
for i in range(1,N):
if P[i] < min_P:
min_P = P[i]
num += 1
print(num) | p02791 |
N = int(eval(input()))
count = 1
P = list(map(int,input().split()))
for n in range(1,N):
if min(P[0:n]) >= P[n]:
count += 1
print(count) | N = int(eval(input()))
count = 1
P = list(map(int,input().split()))
last_min = P[0]
for n in range(1,N):
if last_min >= P[n]:
count += 1
last_min = min(last_min,P[n])
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 1
for i in range(1, len(P)):
if min(P[0:i]) >= P[i]:
cnt += 1
print(cnt) | N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
mini = float('inf')
for i in range(0, len(P)):
if P[i] < mini:
cnt += 1
mini = P[i]
print(cnt) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))[::-1]
x = list(range(1, n+1))
cnt = 0
for i in p:
if x.index(i) == 0:
cnt += 1
x.remove(i)
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 1
mi = p[0]
for i in range(1, n):
if mi > p[i]:
mi = p[i]
ans += 1
print(ans) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
ans=0
for i in range(N):
if min(P[:i+1])==P[i]:
ans+=1
print(ans) | N=int(eval(input()))
P=list(map(int,input().split()))
ans=1
m=P[0]
for i in range(1,N):
if m>=P[i]:
ans+=1
m=P[i]
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
result = 0
# for i, p in enumerate(P):
# subary = P[:i+1]
# if (min(subary) >= p):
# result += 1
for i in range(len(P)):
subary = P[:i+1]
if (min(subary) >= P[i]):
result += 1
print(result)
| N = int(eval(input()))
P = list(map(int, input().split()))
result = 0
minValue = P[0]
for i, p in enumerate(P):
if (minValue >= p):
result += 1
minValue = p
print(result) | p02791 |
N = int(eval(input()))
P_list = list(map(int,input().split()))
M_list = []
cnt = 0
for j in range(1,N+1):
M_list.append(min(P_list[:j]))
for i in range(N):
if M_list[i] == P_list[i]:
cnt += 1
print(cnt) | N = int(eval(input()))
P_list = list(map(int,input().split()))
M = P_list[0]
cnt = 1
for i in range(N):
if M > P_list[i]:
cnt += 1
M = P_list[i]
print(cnt) | p02791 |
N=int(eval(input()))
P = list(map(int,input().split()))
#print(N)
#print(P)
SUCCESS = N
pre_max = P[0]
pre_min = P[0]
for i in range(N):
j = i - 1
if pre_max < P[i]:
#print(i, j, pre_max)
pre_max = P[j]
SUCCESS -= 1
continue
if pre_min < P[i]:
#print(i, j, pre_min)
#pre_min = P[j]
SUCCESS -= 1
continue
while j >= 0:
if pre_min > P[j]:
pre_min = P[j]
if P[i] > P[j]:
#print("Fail", i,j)
SUCCESS -= 1
break
j -= 1
print(SUCCESS) | N=int(eval(input()))
P = list(map(int,input().split()))
#print(N)
#print(P)
SUCCESS = N
pre_max = P[0]
pre_min = P[0]
for i in range(N):
j = i - 1
if pre_min < P[i]:
SUCCESS -= 1
continue
else:
pre_min = P[i]
print(SUCCESS) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
test = [i for i in range(N) if P[i]==min(P[:i+1])]
print((len(test)))
| N = int(eval(input()))
P = list(map(int, input().split()))
dummy = 2*10**5
answer = 0
for p in P:
if p <= dummy:
answer += 1
dummy = p
print(answer) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
for i in range(1,N):
if min(P[0:i]) >= P[i]:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
tempmin = P[0]
for i in range(1,N):
if tempmin >= P[i]:
tempmin = P[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[:i+1]):
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
min = p[0]
for i in range(n):
if p[i] <= min:
ans += 1
min = p[i]
print(ans) | p02791 |
n = int(eval(input()))
p = [int(s) for s in input().split()]
flag = -1
m_ans = 0
for i in range(n):
i_min = min(p[:i+1])
if(i_min < p[i]):
#print(p[j],p[i])
m_ans += 1
print((n - m_ans)) | n = int(eval(input()))
p = [int(s) for s in input().split()]
flag = -1
m_ans = 1
p_z = p[0]
for i in range(1,n):
p_z = min(p_z,p[i])
if(p_z >= p[i]):
#print(p[j],p[i])
m_ans += 1
print(m_ans) | p02791 |
N=int(eval(input()))
p=list(map(int,input().split()))
a=0
for i in range(N):
if min(p[0:i+1])==p[i]:
a+=1
print(a)
| N=int(eval(input()))
p=list(map(int,input().split()))
a=0
b=p[0]
for i in range(N):
if p[i]<=b:
a+=1
b=p[i]
else:
pass
print(a) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split(' ')))
num = 0
for i in range(N):
if all([P[i] <= P[j] for j in range(i)]):
num += 1
print(num) | N = int(eval(input()))
P = list(map(int, input().split(' ')))
min = N
num = 1
for i in range(1, N):
if min > P[i - 1]:
min = P[i - 1]
if P[i] <= min:
num += 1
print(num)
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
miss = 0
max = p[0]
for i in range(n):
s = p[0:i]
if not s:
continue
if p[i] > p[i-1]:
miss += 1
continue
if max < p[i]:
max = p[i]
if p[i] > max:
miss += 1
continue
s = sorted(s,reverse=True)
for j in range(i):
if p[i] > s[j]:
miss += 1
break
print((n-miss)) | n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
t = p[0]
for i in range(n):
if t >= p[i]:
cnt += 1
t = p[i]
print(cnt) | p02791 |
N = int(eval(input()))
res = 0
p = list(map(int, input().split()))
for i in range(N):
mini = min(p[:(i+1)])
if mini >= p[i]:
res += 1
print(res) | N = int(eval(input()))
res = 0
p = list(map(int, input().split()))
mini = p[0]
for i in range(N):
mini = min(mini, p[i])
if mini >= p[i]:
res += 1
print(res)
| p02791 |
eval(input())
lst=[]
s=0
for i in map(int,input().split()):
lst.append(i)
if min(lst)==i:
s+=1
print(s) | N=int(eval(input()))
lst=list(map(int,input().split()))
s=0
min=lst[0]
for i in lst:
if i<=min:
min=i
s+=1
print(s) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
for i in range(N):
if i == 0:
cnt += 1
else:
if all(list([x > P[i] for x in P[:i]])):
cnt += 1
print(cnt) | N = int(eval(input()))
P = list(map(int, input().split()))
m = 2 * (10 ** 5) + 1
cnt = 0
for i in range(N):
if P[i] < m:
cnt += 1
m = min(P[i], m)
print(cnt)
| p02791 |
N = int(eval(input()))
Ps = list(map(int, input().split()))
ans = 0
for i,p in enumerate(Ps):
if p==min(Ps[:i+1]):
ans += 1
if p==1:
break
print(ans) | N = int(eval(input()))
Ps = list(map(int, input().split()))
ans = 0
min_val = Ps[0]
for i,p in enumerate(Ps):
if p<=min_val:
ans += 1
min_val = p
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 1
for i in range(1,n):
# print(i, min(p[:i+1]), p[i])
if min(p[:i+1]) == p[i]:
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):
# print(i, min(p[:i+1]), p[i])
m = min(m, p[i])
if m == p[i]:
count += 1
print(count)
| p02791 |
N = int(input().strip())
ns = [int(x) for x in input().split(' ')]
cnt=0
for i in range(len(ns)):
if ns[i] == min(ns[0:i+1]):
cnt+=1
print(cnt) | N = int(input().strip())
ns = [int(x) for x in input().split(' ')]
cnt=0
mini = 200001
for i in range(len(ns)):
if ns[i] <mini:
cnt+=1
mini=ns[i]
print(cnt) | p02791 |
n=int(eval(input()))
a=list(map(int, input().split()))
ans=0
for i in range(n):
if a[i]==min(a[:i+1]):
ans+=1
print(ans) | n=int(eval(input()))
a=list(map(int, input().split()))
m=a[0]
ans=0
for i in range(n):
x=a[i]
if x<=m:
ans+=1
m=x
print(ans) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
count=0
for i in range(n):
val=i+1
l=[]
for j in range(val):
l.append(p[j])
if min(l)==p[j]:
count+=1
print(count) | n=int(eval(input()))
p=list(map(int,input().split()))
count=0
min=100000000
for i in range(n):
if min>=p[i]:
count+=1
min=p[i]
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = n
for i in range(1,n):
if i> n- p[i]:
ans -=1
else:
for j in range(i+1):
r = True
if p[i]>p[j]:
ans -=1
break
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
m = 200001
for i in p:
if i<m:
ans+=1
m=i
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans=1
for i in range(1,n):
if min(p[0:i])>p[i]:
ans+=1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
m = p[0]
ans=1
for i in p[1:]:
if m>i:
ans+=1
m=i
print(ans) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
ct=1
i=1
maxn=p.index(i)
while True:
if maxn==0:
break
p=p[0:maxn]
i+=1
maxn=p.index(min(p))
ct+=1
print(ct) | n=int(eval(input()))
p=list(map(int,input().split()))
ct=1
minn=p[0]
for i in range(1,n):
if minn==1:
#ct+=1
break
elif minn>p[i]:
minn=p[i]
ct+=1
print(ct) | p02791 |
n = int(eval(input()))
p = [int(x) for x in input().split()]
ans = 0
for i in range(n):
baes = p[i]
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 = [int(x) for x in input().split()]
ans = 1
base = p[0]
for i in range(1, n):
if p[i] < base:
ans += 1
base = p[i]
print(ans)
| p02791 |
num = int(eval(input()))
p = list(map(int, input().split()))
pList = list(p)
ret = 0
for i in range(num):
check = True
for j in range(i):
if pList[i] >= pList[j]:
check = False
break
if check == True:
ret = ret + 1
print(("{}".format(ret))) | num = int(eval(input()))
p = list(map(int, input().split()))
pList = list(p)
ret = 0
min = pList[0]
for i in range(num):
if pList[i] <= min:
min = pList[i]
ret = ret + 1
print(("{}".format(ret))) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
for i in range(n):
if min(p[:i+1]) == p[i]:
ans+=1
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
pmin = 10**7
for i in range(n):
pmin = min(pmin,p[i])
if p[i] <= pmin:
ans+=1
print(ans)
| p02791 |
# Binary Indexed Tree (Fenwick Tree)
class BIT:
def __init__(self, n):
self.n = n
self.data = [0]*(n+1)
self.el = [0]*(n+1)
def sum(self, i):
s = 0
while i > 0:
s += self.data[i]
i -= i & -i
return s
def add(self, i, x):
# assert i > 0
self.el[i] += x
while i <= self.n:
self.data[i] += x
i += i & -i
def get(self, i, j=None):
if j is None:
return self.el[i]
return self.sum(j) - self.sum(i)
N = int(eval(input()))
P = [int(i) for i in input().split()]
res = 0
bit = BIT(200010)
for i, p in enumerate(P):
bit.add(p, 1)
res += 1 if bit.sum(p) <= 1 else 0
# print(bit.sum(p))
print(res)
| # # Binary Indexed Tree (Fenwick Tree)
# class BIT:
# def __init__(self, n):
# self.n = n
# self.data = [0]*(n+1)
# self.el = [0]*(n+1)
# def sum(self, i):
# s = 0
# while i > 0:
# s += self.data[i]
# i -= i & -i
# return s
# def add(self, i, x):
# # assert i > 0
# self.el[i] += x
# while i <= self.n:
# self.data[i] += x
# i += i & -i
# def get(self, i, j=None):
# if j is None:
# return self.el[i]
# return self.sum(j) - self.sum(i)
# N = int(input())
# P = [int(i) for i in input().split()]
# res = 0
# bit = BIT(200010)
# for i, p in enumerate(P):
# bit.add(p, 1)
# res += 1 if bit.sum(p) <= 1 else 0
# # print(bit.sum(p))
# print(res)
INF = 10**18
N = int(eval(input()))
P = [int(i) for i in input().split()]
minp = INF
res = 0
for p in P:
if p < minp:
minp = p
res += 1
print(res) | p02791 |
N = int(eval(input()))
P = [int(x) for x in input().split()]
cnt = 0
for i in range(N)[::-1]:
for j in range(N)[i::-1]:
if P[i] > P[j]:
break
elif j == 0:
cnt += 1
print(cnt) | N = int(eval(input()))
P = [int(x) for x in input().split()]
cnt = 1
m = P[0]
for i in P[1:]:
if i < m:
m = i
cnt += 1
print(cnt) | p02791 |
n = int(eval(input()))
pList = list(map(int,input().split()))
count = 1
for i in range(1,n-1):
if min(pList[:i]) >= pList[i]:
count += 1
if len(pList) != 1:
if min(pList[:-1]) >= pList[-1]:
count += 1
print(count)
| n = int(eval(input()))
pList = list(map(int,input().split()))
count = 0
minL = pList[0]
for i in range(n):
if minL >= pList[i]:
count += 1
minL = pList[i]
if minL == 1:
break
print(count)
| p02791 |
n = int(eval(input()))
lst = list(map(int,input().split()))
ans = 1
for i in range(1,n):
if min(lst[:i]) > lst[i]:
ans += 1
print(ans) | n = int(eval(input()))
lst = list(map(int,input().split()))
ans = 1
lst_min = []
for i in range(n):
if i == 0:
lst_min.append(lst[i])
else:
lst_min.append(
min(lst_min[i-1], lst[i])
)
if lst_min[i] == lst[i]:
ans += 1
print(ans) | p02791 |
N = int(eval(input()))
#P = [int(i) for i in input().split()]
P = list(map(int, input().split()))
P_min = min(P)
count = 1
for i in range(N-1):
if P[i+1] == P_min:
count+=1
break
if min(P[:i+1]) > P[i+1]:
count+=1
print(count) | # https://atcoder.jp/contests/abc152/submissions/9600286
N = int(eval(input()))
P = list(map(int, input().split()))
c = 10**9
count = 0
for i in P:
#リストの始めから探索
#minを保持していく
if i < c:
c=i
count+=1
print(count) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
ans=1
for i in range(1,N):
MIN=min(P[0:i])
if MIN>=P[i]:
ans+=1
print(ans) | N=int(eval(input()))
P=list(map(int,input().split()))
ans=0
MIN=10**6
for i in range(N):
MIN=min(MIN,P[i])
if MIN>=P[i]:
ans+=1
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
pre = True
ans = 1
for i in range(1,n):
if pre and p[i]<=p[i-1]:
ans += 1
elif not pre and p[i]>p[i-1]:
pre = False
else:
if min(p[:i])>=p[i]:
ans += 1
pre = True
else:
pre = False
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
pre = True
premin = p[0]
ans = 1
for i in range(1,n):
if pre and p[i]<=p[i-1]:
ans += 1
premin = p[i]
elif not pre and p[i]>p[i-1]:
pre = False
else:
if premin>=p[i]:
ans += 1
pre = True
premin = p[i]
else:
pre = False
print(ans) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
t=[P[0]]
ans=1
for n in range(1,N):
if min(t) < P[n]:
pass
else:
ans+=1
t.append(P[n])
print(ans) | N=int(eval(input()))
P=list(map(int,input().split()))
m=P[0]
ans=1
for p in P:
if m > p:
ans+=1
m=p
print(ans) | p02791 |
n = int(eval(input()))
arr = list(map(int, input().split()))
temp = arr.index(1)
ans = 1
while(temp!=0):
val = arr[:temp].index(min(arr[:temp]))
ans += 1
temp = val
print(ans)
| n = int(eval(input()))
arr = list(map(int, input().split()))
ind = [0]*(n+1)
for i in range(n):
ind[arr[i]] = i
temp = 100000000
ans = 0
for i in range(1,n+1):
if ind[i]<temp:
ans+=1
temp = ind[i]
print(ans)
| p02791 |
N = int(eval(input()))
P = [int(x) for x in input().split()]
R = 1000000
c = 0
for i in range(N):
if min(R, P[i])==P[i]:
c += 1
R = P[i]
else:
pass
print(c) | N = int(eval(input()))
P = list(map(int, input().split()))
m = P[0]
S = 0
for p in P:
if m>=p:
S += 1
m = min(m, p)
print(S) | p02791 |
N = int(eval(input()))
lis = list(map(int, input().split()))
c = 0
if N == 1:
print((lis[0]))
else:
for i in range(N):
f = True
for j in range(i):
if lis[i] > lis[j]:
f = False
if f:
c += 1
print(c) | N = int(eval(input()))
lis = list(map(int, input().split()))
c = 1
j_min = lis[0]
if N == 1:
print(c)
else:
for i in range(1,N):
if j_min > lis[i]:
c += 1
j_min = lis[i]
print(c) | p02791 |
from sys import stdin
N = int(stdin.readline().rstrip())
num_list = [int(i) for i in stdin.readline().rstrip().split()]
output = 0
for n in range(0, N):
now_value = num_list[n]
over_list = [i for i in num_list[:n] if i > now_value]
if len(over_list) == len(num_list[:n]):
output += 1
print(output) | from sys import stdin
N = int(stdin.readline().rstrip())
num_list = [int(i) for i in stdin.readline().rstrip().split()]
output = 0
min_value = float("inf")
for n in range(0, N):
now_value = num_list[n]
if min_value > now_value:
output += 1
min_value = now_value
# over_list = [i for i in num_list[:n] if i > now_value]
# if len(over_list) == len(num_list[:n]):
# output += 1
print(output) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
cout = 0
for i in range(0,n):
if i == 0:
cout = cout + 1
else:
if min(p[0:i+1]) == p[i]:
cout = cout + 1
print(cout)
| n = int(eval(input()))
p = list(map(int, input().split()))
cout = 1
saisyou = p[0]
for i in range(n-1):
if p[i+1] <= saisyou:
cout = cout + 1
saisyou = p[i+1]
print(cout) | p02791 |
N = int(eval(input()))
P = input().split()
count = 0
for i in range(N):
flag = True
for j in range(i):
if int(P[i]) > int(P[j]):
flag = False
break
if flag:
count += 1
print(count)
| N = int(eval(input()))
P = input().split()
count = 0
cur_min = int(P[0])
for i in range(N):
if cur_min >= int(P[i]):
cur_min = int(P[i])
count += 1
print(count)
| p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
List = []
ans = 0
for i in range(N):
if(i == 0):
ans += 1
else:
tmp = P[i-1]
List.append(tmp)
if(P[i] <= min(List)):
ans += 1
print((str(ans))) | N = int(eval(input()))
P = list(map(int,input().split()))
mi = P[0]
ans = 0
for i in range(N):
if(i == 0):
ans += 1
else:
if(P[i] <= mi):
ans += 1
mi = P[i]
print((str(ans))) | p02791 |
# -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
return tuple(map(int, input().split()))
# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
return tuple(map(int1, input().split()))
def main():
n = input_int()
p = input_to_int_tuple()
cnt = 0
for i in range(n):
if i == 0 or p[i] <= min(p[:i]):
cnt += 1
# temp = True
# for j in range(i):
# if p[i] > p[j]:
# temp = False
# break
# if temp:
# cnt += 1
print(cnt)
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
return tuple(map(int, input().split()))
# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
return tuple(map(int1, input().split()))
def main():
n = input_int()
p = input_to_int_tuple()
cnt = 0
pre_min = 10 ** 6
for i in range(n):
if i == 0 or p[i] <= pre_min:
cnt += 1
pre_min = min(pre_min, p[i])
# temp = True
# for j in range(i):
# if p[i] > p[j]:
# temp = False
# break
# if temp:
# cnt += 1
print(cnt)
if __name__ == "__main__":
main()
| 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
if P[i] == 1:
break
print(ans)
| def main():
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
min_val = P[0]
for i in range(1,N):
if P[i] < min_val:
ans += 1
min_val = P[i]
if min_val == 1:
break
print(ans)
if __name__ == "__main__":
main()
| p02791 |
n = int(eval(input()))
pp = list(map(int, input().split()))
cnt = 0
for i in range(n):
if min(pp[:i + 1]) >= pp[i]:
cnt += 1
print(cnt) | n = int(eval(input()))
pp = list(map(int, input().split()))
cnt = 0
min_val = 2 * 10 ** 5 + 1
for p in pp:
if min_val >= p:
cnt += 1
min_val = p
print(cnt) | p02791 |
N = int(eval(input()))
P = [int(x) for x in input().split()]
ans = 0
m = 0
for i in range(N):
for j in range(m, i):
if P[i] > P[j]:
m = j
break
else:
ans += 1
print(ans)
| N = int(eval(input()))
P = [int(x) for x in input().split()]
mins = [0]*N
mins[0] = P[0]
for n in range(1,N):
mins[n] = min(P[n],mins[n-1])
ans = 0
for i in range(N):
if P[i] == mins[i]:
ans += 1
print(ans)
| p02791 |
import bisect
n = int(eval(input()))
p = list(map(int,input().split()))
l = []
c = 0
for i in p:
ind = bisect.bisect_left(l,i)
l.insert(ind, i)
if ind == 0:
c += 1
print(c) | n = int(eval(input()))
p = list(map(int,input().split()))
l = []
c = 1
now = p[0]
for i in p[1:]:
if now > i:
now = i
c += 1
print(c) | p02791 |
# abc152
n = int(eval(input()))
lists = list(map(int,input().split()))
ans = n
for i in range(n):
if min(lists[:i+1]) != lists[i]:
ans -= 1
print(ans) | # abc152
n = int(eval(input()))
lists = list(map(int,input().split()))
std = lists[0]
ans = 1
for i in range(1,n):
if lists[i] < std:
ans += 1
std = lists[i]
print(ans) | 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 = 0
m = p[0]
for i in p:
m = min(m, i)
if m == i:
count += 1
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
counter = 0
for i in range(n):
if i == 0:
counter += 1
else:
Min = min(p[:i+1])
if Min == p[i]:
counter += 1
else:
pass
print(counter) | n = int(eval(input()))
p = list(map(int, input().split()))
counter = 0
Min = p[0]
for i in range(n):
if i == 0:
counter += 1
else:
if p[i] <= Min:
counter += 1
Min = p[i]
print(counter) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
A=[]
ans=0
for i in P:
A.append(i)
if min(A)==i:
ans+=1
print(ans) | N=int(eval(input()))
P=list(map(int,input().split()))
A=10**100
ans=0
for i in P:
A=min(A,i)
if A==i:
ans+=1
print(ans) | p02791 |
n1 = int(eval(input()))
n2 = [int(i) for i in input().split()]
r1 = 0
for i1 in range(n1):
if i1 == 0:
r1 += 1
continue
t1 = n2[0: i1]
t1.sort()
if t1[0] > n2[i1]:
r1 += 1
print(r1)
| n1 = int(eval(input()))
n2 = [int(i) for i in input().split()]
r1 = 0
m1 = n1 + 1
for i1 in range(n1):
if n2[i1] < m1:
r1 +=1
m1 = n2[i1]
print(r1) | p02791 |
n = int(eval(input()))
p_n = list(map(int, input().split()))
ans = 1
p_i_1 = [p_n[0]]
for i in range(1, n):
if min(p_i_1) > p_n[i]:
ans += 1
p_i_1.append(p_n[i])
print(ans)
| n = int(eval(input()))
p_n = list(map(int, input().split()))
ans = 1
p_i_1 = [p_n[0]]
m = p_n[0]
for i in range(1, n):
if m > p_n[i]:
ans += 1
m = min(m, p_n[i])
p_i_1.append(p_n[i])
if m == 1:
break
print(ans)
| p02791 |
from sys import stdin
N=int(eval(input()))
P=[int(x) for x in stdin.readline().rstrip().split()]
ans=0
flag=True
for i in range(N):
for j in range(i):
if(P[i]>P[j]):
flag=False
break
if flag:ans+=1
flag=True
print(ans) | from sys import stdin
N=int(eval(input()))
P=[int(x) for x in stdin.readline().rstrip().split()]
ans=1
min=P[0]
for i in range(1,N):
if(P[i] < min):
ans+=1
min=P[i]
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
for i in range(N):
Flg = True
for j in range(i+1):
if P[j] < P[i]:
Flg = False
break
if Flg:
cnt += 1
print(cnt)
| N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
min_value = N + 1
for i in range(N):
if P[i] <= min_value:
cnt += 1
min_value = P[i]
print(cnt)
| p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
T = [0]*N
ans = 0
for i in range(N):
T[i] = min([P[0]]+P[:i])
for i in range(N):
if P[i] <= T[i]:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int,input().split()))
T = [P[0]]+[10**10]*(N-1)
ans = 0
for i in range(N):
T[i] = min(T[i-1],P[i])
for i in range(N):
if P[i] <= T[i]:
ans += 1
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
k=0
l=0
for i in range(N):
for j in range(i+1):
if P[i]<=P[j]:
k+=1
if k ==i+1:
l+=1
k=0
print(l) | N = int(eval(input()))
P = list(map(int,input().split()))
count = 1
min_num = min(P[0:1])
for i in range(1,N):
if P[i] <= min_num:
count+=1
min_num = P[i]
print(count) | p02791 |
N = int(eval(input()))
Ps = list(map(int, input().split()))
count = 0
for i in range(N):
minimum = min(Ps[:i + 1])
if minimum == Ps[i]:
count += 1
print(count) | N = int(eval(input()))
Ps = list(map(int, input().split()))
count = 0
minimum = Ps[0]
for i in range(N):
if minimum >= Ps[i]:
minimum = Ps[i]
count+=1
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
A = [1 for i in range(1, N) if P[i] <= min(P[:i])]
print((sum(A) + 1)) | N = int(eval(input()))
P = list(map(int, input().split()))
A = 1
M = P[0]
for i in range(1, N):
M = min(M, P[i])
if P[i] <= M:
A += 1
print(A) | p02791 |
def resolve():
N = int(eval(input()))
arr = tuple(map(int, input().split()))
counter = 1
for i in range(1,N):
if arr[i] == min(arr[0:i+1]):
counter += 1
print(counter)
if __name__ == "__main__":
resolve() | def resolve():
N = int(eval(input()))
arr = tuple(map(int, input().split()))
tmp = arr[0]
counter = 0
for i in arr:
if i<=tmp:
tmp=i
counter += 1
print(counter)
if __name__ == "__main__":
resolve() | p02791 |
N = int(eval(input()))
P = b = list(map(int, input().split()))
ans = 0
for i in range(N):
P_i = P[i]
if P_i == min(P[:i + 1]):
ans += 1
print(ans)
| N = int(eval(input()))
P = b = list(map(int, input().split()))
ans = 0
P_min = P[0]
for i in range(N):
if P[i] <= P_min:
P_min = P[i]
ans += 1
print(ans)
| p02791 |
n = int(eval(input()))
a = list(map(int,input().split()))
c = 0
for i in range(0,n):
if a[i] == min(a[0:i+1]):
c+=1
print(c)
| n = int(eval(input()))
a = list(map(int,input().split()))
c = 0
x=a[0]
for i in range(0,n):
if x >= a[i]:
# print(a[i])
x=a[i]
c+=1
print(c) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
cnt=0
for i in range(n):
tem=0
for j in range(0,i+1):
if p[i]>p[j]:
tem=0
break
tem+=1
if tem>=1:
cnt+=1
print(cnt) | n=int(eval(input()))
p=list(map(int,input().split()))
ans=0
mini=p[0]
for i in range(n):
if mini>=p[i]:
ans+=1
mini=p[i]
print(ans) | p02791 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = [None]*N
for i in range(N):
if all([A[v] >= A[i] for v in range(i)]):
B[i]=True
else:
B[i]=False
print((B.count(True)))
| N = int(eval(input()))
A = list(map(int, input().split()))
min = 0
cnt = 0
for i in range(N):
if i == 0:
cnt += 1
min = A[i]
continue
if A[i] <= min:
cnt += 1
min = A[i]
print(cnt) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
def m(n):
return min(P[:n+1])
A=[]
for i in range(N):
A.append(m(i))
print((len(set(A)))) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
n_min = 0
for i in range(0,n):
if i == 0:
ans += 1
n_min = p[i]
continue
if p[i] <= n_min:
ans += 1
n_min = p[i]
print(ans) | p02791 |
N=int(eval(input()))
data = list(map(int, input().split()))
ans=0
for i in range(0,N):
a=[]
a=data[0:i+1]
if a[i]==min(a):
ans+=1
print(ans) | N=int(eval(input()))
data = list(map(int, input().split()))
ans=1
minmin=data[0]
if N==1:
ans=1
elif N>1:
minmin=data[0]
for i in range(1,N):
if data[i]<=minmin:
minmin=data[i]
#if minmin<=data[i]:
ans+=1
#continue
#if minmin<=data[i]:
#ans+=1
print(ans) | p02791 |
def main():
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)
if __name__ == "__main__":
main() |
def main():
n = int(eval(input()))
p = list(map(int, input().split(" ")))
ans = 0
min = 2e5+1
for i in range(n):
if min > p[i]:
min = p[i]
if p[i] <= min:
ans += 1
print(ans)
if __name__ == "__main__":
main() | p02791 |
n, *p_n = list(map(int, open(0).read().split()))
count = 0
for i in range(n):
if min(p_n[:i+1]) == p_n[i]:
count += 1
print(count) | n, *p_n = list(map(int, open(0).read().split()))
count = 0
p_n_min = p_n[0]
for i in range(n):
p_n_min = min(p_n_min,p_n[i])
if p_n_min == p_n[i]:
count += 1
print(count) | p02791 |
n, *p_n = list(map(int, open(0).read().split()))
count = 0
p_n_min = p_n[0]
for i in range(n):
p_n_min = min(p_n_min,p_n[i])
if p_n_min == p_n[i]:
count += 1
print(count) | n, *p_n = list(map(int, open(0).read().split()))
count = 0
min_num = p_n[0]
for p in p_n:
if p <= min_num:
min_num = p
count += 1
print(count) | p02791 |
n = int(eval(input()))
P = list(map(int, input().split()))
c = 0
for i in range(n):
if i ==0:
c+=1
elif P[i] < min(P[0:i]):
c +=1
print(c) | n = int(eval(input()))
P = list(map(int, input().split()))
c = 0
for i in range(n):
if i ==0:
c+=1
current_min = P[i]
elif P[i] < current_min:
c +=1
current_min = P[i]
print(c) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
p_min = []
for ind in range(1,n+1):
p_min.append(min(p[:ind]))
# print(p_min)
cnt = 0
for ind in range(n):
if p[ind] <= p_min[ind]:
cnt += 1
print(cnt)
| n = int(eval(input()))
p = list(map(int, input().split()))
p_min = p[0]
cnt = 0
for ind in range(n):
if p[ind] <= p_min:
cnt += 1
p_min = min(p[ind],p_min)
print(cnt) | p02791 |
n = int(eval(input()))
p_list = [i for i in map(int, input().split())]
ans = 0
for i in range(n):
#i番目までのリストを作成
check_part = p_list[:i+1]
#その中で一番小さいかどうか
if p_list[i] == min(check_part):
ans += 1
print(ans) | n = int(eval(input()))
p_list = [i for i in map(int, input().split())]
ans = 0
min = n + 1
for i in range(n):
if p_list[i] < min:
min = p_list[i]
ans += 1
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
a = []
b = []
ans = 1
for i in range(1,len(P)):
a = P[:i + 1]
b= P[i]
a.sort()
if b == a[0]:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int,input().split()))
mi = 10**7
b = [0]*N
for i in range(N):
if mi > P[i]:
b[i] += 1
mi=P[i]
print((sum(b)))
| p02791 |
n = int(eval(input()))
seq = list(map(int,input().split()))
ans = 1
for i in range(1, len(seq)):
if min(seq[0:i]) > seq[i]:
ans += 1
print(ans) | n = int(eval(input()))
seq = list(map(int,input().split()))
ans = 1
minim = n
for i in range(1, n):
minim = min(minim, seq[i-1])
if minim > seq[i]:
ans += 1
print(ans) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
count=1
for i in range(1,n):
if min(p[i],min(p[:i])) == p[i]:
count+=1
print(count)
| n=int(eval(input()))
p=list(map(int,input().split()))
count=0
q=100000000
for i in range(n):
if min(p[i],q) == p[i]:
count+=1
q=p[i]
print(count)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 1
for i in range(1, N):
for j in range(i):
if P[j] < P[i]:
break
else:
count = count + 1
print(count) | N = int(eval(input()))
P = list(map(int, input().split()))
count = 1
minP = P[0]
for i in range(1, N):
if P[i] < minP:
count = count + 1
minP = P[i]
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 1
curr = P[0]
for p in P[1:]:
if p <= curr:
cnt += 1
curr = p
print(cnt) | eval(input())
p0, *P = list(map(int, input().split()))
cnt = 1
curr = p0
for p in P:
if p < curr:
cnt += 1
curr = p
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i, j in enumerate(P):
if min(P[:i + 1]) >= j:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
p_min = P[0]
for i, j in enumerate(P):
if p_min >= j:
ans += 1
p_min = j
print(ans) | p02791 |
n = int(eval(input()))
p_ls = list(map(int, input().split()))
sum_=0
for i in range(0,n):
j=0
if i==0: max_,min_=p_ls[i],p_ls[i]
#print('%d %d'%(i,j))
#print(max_)
while j<=i:
if min_>p_ls[i]:
min_=p_ls[i]
break
elif max_<p_ls[i]:
max_=p_ls[i]
sum_-=1
break
elif p_ls[j]<p_ls[i]:
sum_-=1
break
j+=1
sum_+=1
print(sum_) | n = int(eval(input()))
p_ls = list(map(int, input().split()))
sum_=1
min_=p_ls[0]
for i in range(1,n):
if min_>=p_ls[i]:
min_=p_ls[i]
sum_+=1
print(sum_) | p02791 |
def main():
import sys
N = int(eval(input()))
input_2 = sys.stdin.readline
P_list = list(map(int,input_2().split()))
i_num = 0
for i in range(N):
if P_list[i] <= min(P_list[:i+1]):
i_num += 1
print(i_num)
if __name__ == "__main__":
main() | N = int(eval(input()))
P_list = list(map(int,input().split()))
i_num = 0
min_P = P_list[0]
for p in P_list:
if p <= min_P:
min_P = p
i_num += 1
print(i_num) | p02791 |
def main():
N = int(eval(input()))
P_list = list(map(int,input().split()))
i_num = 0
min_P = P_list[0]
for p in P_list:
if p <= min_P:
min_P = p
i_num += 1
print(i_num)
if __name__ == "__main__":
main() | def main():
import sys
N = int(eval(input()))
input_2 = sys.stdin.readline
P_list = list(map(int,input_2().split()))
i_num = 0
min_P = P_list[0]
for p in P_list:
if p <= min_P:
min_P = p
i_num += 1
print(i_num)
if __name__ == "__main__":
main() | p02791 |
N = int(eval(input()))
array = list(map(int, input().split()))
cnt = 0
for i in range(0, N):
array2 = list(array[0:i+1])
array2.sort()
if array2[0] == array[i]:
cnt += 1
print(cnt) | N = int(eval(input()))
array = list(map(int, input().split()))
cnt = 1
minv = array[0]
for i in range(1, N):
if minv > array[i]:
minv = array[i]
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
# P = np.array(input().split(' '), dtype = int)
P = list(map(int, input().split(' ')))
ar_bool = [(min(P[:i+1]) == P[i]) for i in range(N)]
print((sum(ar_bool))) | N = int(eval(input()))
# P = np.array(input().split(' '), dtype = int)
P = list(map(int, input().split(' ')))
p_min = P[0]
ans = 0
for p in P:
if p <= p_min:
p_min = p
ans += 1
print(ans)
| p02791 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.