input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
tmp = 1
for j in range(K):
tmp *= A[j]
for i in range(1, N-K+1):
ans = 1
for j in range(K):
ans *= A[i+j]
# print(tmp, ans)
if tmp < ans:
print('Yes')
else:
print('No')
tmp = ans
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N-K):
if A[i] < A[i+K]:
print('Yes')
else:
print('No')
| p02602 |
n, k = list(map(int, input().split()))
li = list(map(int, input().split()))
s = 1
for i in range(k):
s *= li[i]
for i in range(k, n):
t = s * li[i]
t //= li[i-k]
if s < t:
print('Yes')
else:
print('No')
s = t
| n, k = list(map(int, input().split()))
li = list(map(int, input().split()))
for i in range(k, n):
if li[i-k] < li[i]:
print('Yes')
else:
print('No')
| p02602 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(1,N):
A[i] *= A[i-1]
A = [1] + A
for i in range(K,N):
if A[i]/A[i-K] < A[i+1]/A[i+1-K]:
print('Yes')
else:
print('No') | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(K,N):
if A[i-K] < A[i]:
print('Yes')
else:
print('No') | p02602 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
# 累積積
AC = [1]
for a in A:
AC.append(AC[-1]*a)
AC.pop(0)
# print(AC)
for i in range(k,n):
if (i-1)-k < 0:
prev = AC[i-1]
else:
prev = AC[i-1] / AC[(i-1)-k]
if i-k < 0:
now = AC[i]
else:
now = AC[i] / AC[i-k]
# print(prev)
# print(now)
# print((i-1)-(k))
# print(i-1)
# print("****")
# print(i-(k))
# print(i)
if prev < now:
print("Yes")
else:
print("No")
# print("----------") | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(k,n):
if A[i-k] < A[i]:
print("Yes")
else:
print("No") | p02602 |
from sys import stdin
def multiple(A,st,ed):
res = 1
for i in range(st,ed):
res = res * A[i]
return res
def main():
n, k = [int(x) for x in stdin.readline().rstrip().split()]
A = [int(x) for x in stdin.readline().rstrip().split()]
H = [0] * (n-k)
pre = multiple(A,0,k)
H[0] = pre
st = -1
for i in range(k+1,n+1):
st += 1
cur = pre * A[i-1] / A[st]
if cur > pre:
print("Yes")
else:
print("No")
pre = cur
if __name__ == "__main__":
main() | from sys import stdin
def multiple(A,st,ed):
res = 1
for i in range(st,ed):
res = res * A[i]
return res
def main():
n, k = [int(x) for x in stdin.readline().rstrip().split()]
A = [int(x) for x in stdin.readline().rstrip().split()]
st = -1
for i in range(k+1,n+1):
st += 1
if A[i-1] > A[st]:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main() | p02602 |
def main():
n, k = list(map(int, input().split()))
results = tuple(map(int, input().split()))
products = 1
for result in results[:k]:
products *= result
for i in range(n-k):
new_products = products * results[i+k] / results[i]
if products < new_products:
print('Yes')
else:
print('No')
products = new_products
if __name__ == '__main__':
main()
| def main():
n, k = list(map(int, input().split()))
results = tuple(map(int, input().split()))
for i in range(n-k):
print(('Yes' if results[i] < results[i+k] else 'No'))
if __name__ == '__main__':
main()
| p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = []
for i in range(n-k+1):
x = 1
for j in range(i,k+i):
x *= a[j]
b.append(x)
for i in range(n-k):
if b[i+1] > b[i]:
print('Yes')
else:
print('No') | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(n-k):
if a[i] < a[i+k]:
print('Yes')
else:
print('No') | p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = 1
for i in range(k):
b *= a[i]
for i in range(k,n):
c = b
b = b // a[i-k]
b *= a[i]
if b > c:
print('Yes')
else:
print('No') | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = 1
for i in range(k,n):
if a[i] > a[i-k]:
print('Yes')
else:
print('No') | p02602 |
import collections
d = collections.deque()
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
for _ in range(K):
d.append(A[_])
for i in range(K,N):
sum_1 = sum(d)
d.popleft()
d.append(A[i])
sum_2 = sum(d)
if sum_1 < sum_2: print('Yes')
else: print('No') | N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
for i in range(K,N):
a = A[i-K]
b = A[i]
if a<b: print('Yes')
else: print('No') | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
g = 1
grade = []
for i in range(n):
g *= a[i]
if i+1 > k:
g /= a[i-k]
grade.append(int(g))
for i in range(k, n):
if grade[i-1] < grade[i]:
print('Yes')
else:
print('No') | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n):
if i+1 > k:
if a[i-k] < a[i]:
print('Yes')
else:
print('No') | p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.reverse()
s=1
for i in range(k):
s*=a[i]
x=[s]
for i in range(k,n):
s//=a[i-k]
s*=a[i]
x.append(s)
x.reverse()
for i in range(1,len(x)):
if x[i]>x[i-1]:
print("Yes")
else:
print("No")
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.reverse()
ans=[]
for i in range(k,n):
if a[i]<a[i-k]:
ans.append("Yes")
else:
ans.append("No")
ans.reverse()
for s in ans:
print(s)
| p02602 |
# Problem C - Marks
# input
N, K = list(map(int, input().split()))
a_nums = list(map(int, input().split()))
# initialization
cumulative_sum = 1
for i in range(K):
cumulative_sum *= a_nums[i]
cumulative_list = [0] * N
cumulative_list[K-1] = cumulative_sum
# cumulative sum calc
for i in range(K, N):
cumulative_sum = cumulative_sum // a_nums[i-K]
cumulative_sum = cumulative_sum * a_nums[i]
cumulative_list[i] = cumulative_sum
# check
for i in range(K, N):
if cumulative_list[i]>cumulative_list[i-1]:
print("Yes")
else:
print("No")
| # Problem C - Marks
# input
N, K = list(map(int, input().split()))
a_nums = list(map(int, input().split()))
# initialization
cumulative_sum = 1
for i in range(K):
cumulative_sum += a_nums[i]
cumulative_list = [0] * N
cumulative_list[K-1] = cumulative_sum
# cumulative sum calc
for i in range(K, N):
cumulative_sum = cumulative_sum - a_nums[i-K]
cumulative_sum = cumulative_sum + a_nums[i]
cumulative_list[i] = cumulative_sum
if cumulative_list[i]>cumulative_list[i-1]:
print("Yes")
else:
print("No")
| p02602 |
def prod(A):
ans = 1
for a in A:
ans *= a
return ans
def solve():
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
for i in range(K, N):
if i < K:
continue
if prod(A[i - K + 1:i + 1]) > prod(A[i - K:i]):
print('Yes')
else:
print('No')
if __name__ == "__main__":
solve() | def solve():
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
ans = []
for i in range(K, N):
if A[i - K] < A[i]:
ans.append('Yes')
else:
ans.append('No')
print(('\n'.join(ans)))
if __name__ == "__main__":
solve() | p02602 |
N, K = list(map(int, input().split()))
scores = list(map(int, input().split()))
grades =[]
for i in range(K+1,N+2):
before = 1
for j in range(K):
before = before*scores[i-j-2]
grades.append(before)
for k in range(N-K):
if grades[k]>=grades[k+1]:
print("No")
else:
print("Yes")
| N, K = list(map(int, input().split()))
scores = list(map(int, input().split()))
for k in range(N-K):
if scores[k] >= scores[k+K]:
print("No")
else:
print("Yes") | p02602 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
pre = 1
for i in range(k):
pre *= A[i]
def prod(i, k, pre):
now = pre / A[i-k-1] * A[i-1]
return now
for i in range(k+1, n+1):
now = prod(i, k, pre)
if now <= pre:
print('No')
else:
print('Yes')
pre = now
| n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(k, n):
if A[i] > A[i-k]:
print('Yes')
else:
print('No') | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
p = 1
for i in range(K):
p *= A[i]
for i in range(N-K):
q = (p//A[i])*A[i+K]
if q > p:
print('Yes')
else:
print('No')
p = q
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N-K):
if A[K+i] > A[i]:
print('Yes')
else:
print('No')
| p02602 |
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
import bisect
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
d = 1
for i in range(k):
d = d*a[i]
b = [d]
for i in range(n-k):
c = (b[-1]*a[k+i])//a[i]
b.append(c)
for i in range(n-k):
if b[i+1]>b[i]:
print("Yes")
else:
print("No") | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
import bisect
mod = 10**9+7
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
d = 1
mina = min(a)+1
for i in range(n-k):
if a[i] < a[i+k]:
print("Yes")
else:
print("No") | p02602 |
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
lst=[1]*n
for i in range(n):
if i==0:
lst[i]=A[i]
elif 1<=i<=k-1:
lst[i]=lst[i-1]*A[i]
else:
temp=lst[i-1]//A[i-k]
lst[i]=temp*A[i]
print(("Yes" if lst[i]>lst[i-1] else "No")) | n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
lst=[1]*(n-k+1)
for i in range(n-k+1):
if i==0:
temp=1
for j in range(k):
temp*=A[j]
lst[i]=temp
else:
temp=lst[i-1]//A[i-1]
lst[i]=temp*A[i+k-1]
print(("Yes" if lst[i]>lst[i-1] else "No")) | p02602 |
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
for i in range(n-k+1):
if i==0:
temp=1
for j in range(k):
if A[j]!=1:
temp*=A[j]
else:
newtemp=temp*A[i+k-1]//A[i-1]
print(("Yes" if newtemp>temp else "No"))
temp=newtemp | n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
for i in range(1, n-k+1):
print(("Yes" if A[i+k-1]>A[i-1] else "No")) | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
score = [0]*N
dq = []
score_now = 1
for i in range(0, K):
score_now *= A[i]
left = A[0]
index = 0
for j in range(K-1, N-1):
score[j] = score_now
score_now /= left
index += 1
left = A[index]
score_now *= A[j+1]
score[N-1] = score_now
for k in range(K, N):
if score[k] > score[k-1]:
print("Yes")
else:
print("No")
| N, K = list(map(int, input().split()))
K -= 1
A = list(map(int, input().split()))
index = 0
left = A[index]
for i in range(K+1, N):
if A[index] < A[i]:
print("Yes")
else:
print("No")
index += 1
| p02602 |
from sys import stdin, stdout
n,k=list(map(int,input().split()))
a=[int(o) for o in input().split()]
prod=1
for i in range(k):
prod*=a[i]
for i in range(k,n):
prev=prod
prod//=a[i-k]
prod*=a[i]
if prod>prev: stdout.write("Yes\n")
else: stdout.write("No\n")
| from sys import stdin, stdout
n,k=list(map(int,input().split()))
a=[int(o) for o in input().split()]
prod=1
for i in range(k,n):
prev=a[i-k]
if a[i]>prev: stdout.write("Yes\n")
else: stdout.write("No\n")
| p02602 |
N,K = list(map(int,input().split()))
A = list(map(int, input().split()))
temp_1 = 1 #今
temp_2 = 1 #昔
for i in range(N):
if i==0:
temp_1 *= A[i]
elif i<=(K-1):
temp_2 = temp_1
temp_1 *= A[i]
if i>(K-1):
temp_2 = temp_1
temp_1 /= A[i-K]
temp_1 *= A[i]
if temp_2<temp_1:
print('Yes')
else:
print('No') | N,K = list(map(int,input().split()))
A = list(map(int, input().split()))
temp_1 = 1 #今
temp_2 = 1 #昔
for i in range(N):
if i>(K-1):
if A[i-K]<A[i]:
print('Yes')
else:
print('No') | p02602 |
#!usr/bin/env python3
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n, k = LI()
a = LI()
ans = [1]*n
for i in range(k-1, n):
for j in range(k):
ans[i] *= a[i-j]
if i > k-1:
if i == 0 or ans[i] > ans[i-1]:
print('Yes')
else:
print('No')
return
# Solve
if __name__ == "__main__":
solve()
| #!usr/bin/env python3
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n, k = LI()
a = LI()
for i in range(k, n):
if a[i] > a[i-k]:
print('Yes')
else:
print('No')
return
# Solve
if __name__ == "__main__":
solve()
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
X = 1
for i in range(K):
X *= A[i]
Y = X
for i in range(K, N):
X = X * A[i] // A[i-K]
if Y < X:
print("Yes")
else:
print("No")
Y = X | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K, N):
if A[i-K] < A[i]:
print("Yes")
else:
print("No")
| p02602 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
seki_list = [0]*n
seki = 1
temp = 0
for i in range(n):
seki *= A[i]
seki_list[i] = seki
point = seki_list[k-1]
for i in range(k, n):
temp = seki_list[i]/seki_list[i-k]
if temp > point:
print("Yes")
point = temp
else:
print("No")
point = temp | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(k,n):
if A[i] > A[i-k]:
print("Yes")
else:
print("No")
| p02602 |
N,K = [int(i) for i in input().split()]
A = [1]+[int(i) for i in input().split()]
P = 1
for i in range(1,N+1):
A[i] *= A[i-1]
for i in range(K+1,N+1):
if A[i]/A[i-K] > A[i-1]/A[i-K-1]:
print('Yes')
else:
print('No')
| N,K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
for i in range(K,N):
if A[i] > A[i-K]:
print('Yes')
else:
print('No')
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
c = N - K + 1
l = []
for i in range(K, N + 1):
ans = 1
for j in range(1, K + 1):
ans *= A[i - j]
l.append(ans)
for i in range(c - 1):
if l[i] < l[i + 1]:
print("Yes")
else:
print("No") | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
c = N - K
l = []
for j in range(K, N):
l.append(A[j - K])
l.append(A[j])
L = len(l)
for i in range(0, L, 2):
if l[i + 1] > l[i]:
print("Yes")
else:
print("No")
| p02602 |
N, K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
score = [0]*(N+1)
score[1] = A[1]
for i in range(2, K+1):
score[i] = score[i-1]*A[i]
for i in range(K+1, N+1):
score[i] = score[i-1]*A[i]//A[i-K]
print(('Yes' if score[i] > score[i-1] else 'No'))
| N, K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
for i in range(K+1, N+1):
print(('Yes' if A[i] > A[i-K] else 'No'))
| p02602 |
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
n,k = [int(i) for i in input().strip().split()]
A = [int(i) for i in input().strip().split()]
cur_mul = [1] * n
for i in range(n):
if i == 0:
cur_mul[i] = A[i]
elif i > 0 and i <= k-1:
cur_mul[i] = A[i] * cur_mul[i - 1]
elif i > k-1:
cur_mul[i] = cur_mul[i - 1] * A[i] // A[i - k]
if cur_mul[i] > cur_mul[i - 1]:
print("Yes")
else:
print("No")
return
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
n,k = [int(i) for i in input().strip().split()]
A = [int(i) for i in input().strip().split()]
for i in range(k, n):
if A[i] > A[i - k]:
print("Yes")
else:
print("No")
return
if __name__ == "__main__":
main()
| p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = [1]*n
for i in range(k):
ans[0] *= a[i]
for i in range(n-k):
ans[i+1] = ans[i] * a[i+k] // a[i]
if ans[i+1] > ans[i]:
print("Yes")
else:
print("No") | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(n-k):
if a[i+k] > a[i]:
print("Yes")
else:
print("No") | p02602 |
N, K = list(map(int, input().split()))
Ai = list(map(int, input().split()))
class SegTree:
def __init__(self, init_val, f=lambda x,y : x*y, default=1):
size = len(init_val)
self.size = 2**(size-1).bit_length()
self.default = default
self.dat = [default]*(self.size*2)
self.f = f
for i in range(size):
self.dat[self.size + i] = init_val[i]
for i in range(self.size- 1, 0, -1):
self.dat[i] = self.f(self.dat[2 * i], self.dat[2 * i + 1])
def update(self, i, x):
i += self.size
self.dat[i] = x
while i > 0:
i >>= 1
self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])
def query(self, l, r):
l += self.size
r += self.size
lres, rres = self.default, self.default
while l < r:
if l & 1:
lres = self.f(lres, self.dat[l])
l += 1
if r & 1:
r -= 1
rres = self.f(self.dat[r], rres)
l >>= 1
r >>= 1
res = self.f(lres, rres)
return res
seg = SegTree(Ai)
# print(seg.query(0, 1))
def score(i):
return seg.query(i - K, i)
for i in range(K + 1, N + 1):
sp = score(i - 1)
s = score(i)
if sp < s:
print("Yes")
else:
print("No")
| N, K = list(map(int, input().split()))
Ai = list(map(int, input().split()))
# class SegTree:
# def __init__(self, init_val, f=lambda x,y : x*y, default=1):
# size = len(init_val)
# self.size = 2**(size-1).bit_length()
# self.default = default
# self.dat = [default]*(self.size*2)
# self.f = f
#
# for i in range(size):
# self.dat[self.size + i] = init_val[i]
# for i in range(self.size- 1, 0, -1):
# self.dat[i] = self.f(self.dat[2 * i], self.dat[2 * i + 1])
#
# def update(self, i, x):
# i += self.size
# self.dat[i] = x
# while i > 0:
# i >>= 1
# self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])
#
# def query(self, l, r):
# l += self.size
# r += self.size
# lres, rres = self.default, self.default
# while l < r:
# if l & 1:
# lres = self.f(lres, self.dat[l])
# l += 1
#
# if r & 1:
# r -= 1
# rres = self.f(self.dat[r], rres)
# l >>= 1
# r >>= 1
# res = self.f(lres, rres)
# return res
#
# seg = SegTree(Ai)
# print(seg.query(0, 1))
# def score(i):
# return seg.query(i - K, i)
for i in range(K + 1, N + 1):
# sp = score(i - 1)
# s = score(i)
sp = Ai[i - K - 1]
s = Ai[i - 1]
if sp < s:
print("Yes")
else:
print("No")
| p02602 |
from sys import stdin
N,K = [int(x) for x in stdin.readline().rstrip().split()]
A = [int(x) for x in stdin.readline().rstrip().split()]
score = 1
for i in range(0,K):
score*=A[i]
for i in range(K,N):
if A[i] > A[i-K]:
print("Yes")
else:
print("No") | from sys import stdin
N,K = [int(x) for x in stdin.readline().rstrip().split()]
A = [int(x) for x in stdin.readline().rstrip().split()]
for i in range(K,N):
if A[i] > A[i-K]:
print("Yes")
else:
print("No") | p02602 |
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
after = 1
for i in range(k):
after *= a[i]
ans_list = [after]
for i in range(n-k):
ans_list.append(ans_list[i] / a[i] * a[k+i])
for i in range(n-k):
if ans_list[i] < ans_list[i+1]:
print("Yes")
else:
print("No") | n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n-k):
if a[i] < a[i+k]:
print("Yes")
else:
print("No") | p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
evaluation = 1
for i in range(k):
evaluation *= a[i]
for i in range(k, n+1):
if i == n:
break
#print(a[i], a[i-k])
next_evaluation = a[i]*evaluation//a[i-k]
if evaluation < next_evaluation:
print('Yes')
else:
print('No')
evaluation = next_evaluation | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(k, n+1):
if i == n:
break
#print(a[i], a[i-k])
if a[i-k] < a[i]:
print('Yes')
else:
print('No') | p02602 |
from functools import reduce
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mul = int(reduce(lambda x, y: x * y, A[:K]))
res = [mul]
for i in range(K, N):
res.append(res[-1]*A[i]//A[i-K])
print(('Yes' if res[-2] < res[-1] else 'No'))
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K, N):
print(('Yes' if A[i-K] < A[i] else 'No'))
| p02602 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N,K = LI()
A = LI()
hyoten = [1] * (N-K+1)
for i in range(N-K+1):
for q in range(K):
hyoten[i] *= A[i+q]
for j in range(len(hyoten)-1):
if (hyoten[j+1]>hyoten[j]):
print('Yes')
else:
print('No')
| import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N,K = LI()
A = LI()
# hyoten = [1] * (N-K+1)
# for i in range(N-K+1):
# for q in range(K):
# hyoten[i] *= A[i+q]
# for j in range(len(hyoten)-1):
# if (hyoten[j+1]>hyoten[j]):
# print('Yes')
# else:
# print('No')
for i in range(N-K):
if A[i] < A[i+K]:
print('Yes')
else:
print('No') | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
judge = 1
for i in A[:K]:
judge *= i
for i in range(N-K):
judge2 = judge / A[i] * A[K+i]
if judge2 > judge:
print('Yes')
else:
print('No')
judge = judge2 | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
judge = 1
for i in range(N-K):
if A[K+i] > A[i]:
print('Yes')
else:
print('No') | p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
score_1=1
for i in range(k):
score_1=score_1*a[i]
score_2=score_1*a[k]/a[0]
if score_1<score_2:
print('Yes')
else:
print('No')
for i in range(k+1,n):
score_1=score_2
score_2=score_2*a[i]/a[i-k]
if score_1<score_2:
print('Yes')
else:
print('No')
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(k,n):
if a[i-k]<a[i]:
print('Yes')
else:
print('No') | p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
p = 1
conta = int(k)
for i in range(k):
p = p * a[i]
while conta <= n-1:
next_p = p * a[conta] // a[conta-k]
if next_p > p:
print('Yes')
else:
print('No')
conta += 1 | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(k,n):
if a[i-k] < a[i]:
print('Yes')
else:
print('No') | p02602 |
def INT():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
N, K = MI()
A = LI()
score = 1
for i in range(K):
score *= A[i]
idx = 0
for i in range(K, N):
tmp = score
score = score * A[i] // A[idx]
print(("Yes" if score > tmp else "No"))
idx += 1 | def INT():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
N, K = MI()
A = LI()
idx = 0
for i in range(K, N):
print(("Yes" if A[i] > A[idx] else "No"))
idx += 1 | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
hyoten_i = 1
for i, a in enumerate(A):
hyoten_prev = hyoten_i
hyoten_i *= a
if i + 1 > K:
hyoten_i = hyoten_i / A[i - K]
print(("Yes" if hyoten_i > hyoten_prev else "No")) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i, a in enumerate(A):
if i + 1 > K:
if a > A[i - K]:
print("Yes")
else:
print("No") | p02602 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
keep = 1
for i in range(k):
keep *= A[i]
for j in range(n - k):
if A[k + j] > A[j]:
print("Yes")
else:
print("No")
keep = keep * A[k + j] / A[j]
| n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for j in range(n - k):
if A[k + j] > A[j]:
print("Yes")
else:
print("No")
| p02602 |
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations,product#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal
def input():
x=sys.stdin.readline()
return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False):
inds=sorted(range(len(s)), key=lambda k: s[k])
if return_sorted: return inds, [s[i] for i in inds]
return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
K,N,M=len(B),len(A),len(B[0])
return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
N,size=len(v),len(M)
return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
n,m=len(M),len(M[0])
return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): #xは64bit整数
x= x - ((x >> 1) & 0x5555555555555555)
x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
x+= (x >> 8); x+= (x >> 16); x+= (x >> 32)
return x & 0x7f
class SWAG:#funcとself.ideを設定すること
def __init__(self,func,ide,A):#func:モノイド、ide:単位元、A:ターゲット配列
self.A=tuple(deepcopy(A))#ターゲット配列
self.ide=ide#単位元
self.func=func#モノイド
self.front=self.ide#frontスタックの総演算結果
self.fr=0#frontスタックの右端インデックス
self.fl=0#frontスタックの左端インデックス
self.back=deque()#backスタック
def right(self,step=1):#右端をstep回すすめる
for i in range(step):
self.front=self.func(self.front,self.A[self.fr+i])
self.fr+=step
def left(self,step=1):#左端をstep回すすめる
back=self.back
func=self.func
for _ in range(step):
if not back:
for i in range(self.fr-1,self.fl-1,-1):
x=self.A[i]
if back:
z=func(x,back[-1])
else:
z=x
back.append(z)
self.fl=self.fr
self.front=self.ide
back.pop()
def get(self):#区間funcの計算
if self.back:
return self.func(self.back[-1],self.front)
return self.front
def main():
mod = 1000000007
#w.sort(key=itemgetter(1),reverse=True) #二個目の要素で降順並び替え
#N = int(input())
N, K = map(int, input().split())
A = tuple(map(int, input().split())) #1行ベクトル
#L = tuple(int(input()) for i in range(N)) #改行ベクトル
#S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
def f(a,b):return a*b
seg=SWAG(f,1,A)
seg.right(K)
pr=seg.get()
for i in range(K,N):
seg.right()
seg.left()
c=seg.get()
if c>pr:
print('Yes')
else:
print('No')
pr=c
if __name__ == "__main__":
main()
| import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations,product#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal
def input():
x=sys.stdin.readline()
return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False):
inds=sorted(range(len(s)), key=lambda k: s[k])
if return_sorted: return inds, [s[i] for i in inds]
return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
K,N,M=len(B),len(A),len(B[0])
return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
N,size=len(v),len(M)
return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
n,m=len(M),len(M[0])
return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): #xは64bit整数
x= x - ((x >> 1) & 0x5555555555555555)
x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
x+= (x >> 8); x+= (x >> 16); x+= (x >> 32)
return x & 0x7f
class SWAG:#funcとself.ideを設定すること
def __init__(self,func,ide,A):#func:モノイド、ide:単位元、A:ターゲット配列
self.A=tuple(deepcopy(A))#ターゲット配列
self.ide=ide#単位元
self.func=func#モノイド
self.front=self.ide#frontスタックの総演算結果
self.fr=0#frontスタックの右端インデックス
self.fl=0#frontスタックの左端インデックス
self.back=deque()#backスタック
def right(self,step=1):#右端をstep回すすめる
for i in range(step):
self.front=self.func(self.front,self.A[self.fr+i])
self.fr+=step
def left(self,step=1):#左端をstep回すすめる
back=self.back
func=self.func
for _ in range(step):
if not back:
for i in range(self.fr-1,self.fl-1,-1):
x=self.A[i]
if back:
z=func(x,back[-1])
else:
z=x
back.append(z)
self.fl=self.fr
self.front=self.ide
back.pop()
def get(self):#区間funcの計算
if self.back:
return self.func(self.back[-1],self.front)
return self.front
def main():
mod = 1000000007
#w.sort(key=itemgetter(1),reverse=True) #二個目の要素で降順並び替え
#N = int(input())
N, K = map(int, input().split())
A = tuple(map(int, input().split())) #1行ベクトル
#L = tuple(int(input()) for i in range(N)) #改行ベクトル
#S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
for i in range(K,N):
tail=A[i-K]
head=A[i]
if head>tail:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
score = [0 for i in range(n)]
cnt = 1
for i in range(n):
if i < k - 1:
score[i] = a[i]
cnt *= score[i]
elif i == k - 1:
cnt *= a[i]
score[i] = cnt
else:
cnt *= a[i]
cnt /= a[i - k]
score[i] = cnt
# print("score =", score)
for i in range(k, n):
if score[i] > score[i - 1]:
print("Yes")
else:
print("No") | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
# score = [0 for i in range(n)]
# # cnt = 1
# for i in range(n):
# if i < k - 1:
# score[i] = a[i]
# elif i == k - 1:
# score[i] = score[i - 1] * a[i]
# else:
# score[i] = score[i - 1] * a[i] / a[i - k]
# # print("score =", score)
# for i in range(k, n):
# if score[i] > score[i - 1]:
# print("Yes")
# else:
# print("No")
for i in range(k, n):
if a[i - k] < a[i]:
print("Yes")
else:
print("No") | p02602 |
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
tmp = 1
for i in range(K):
tmp *= A[i]
for i in range(N-K):
t = tmp // A[i]
t *= A[i+K]
if t > tmp:
print('Yes')
else:
print('No')
tmp = t
if __name__ == "__main__":
main()
| def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N-K):
if A[i+K] > A[i]:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
| p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
p=1
for i in a[:k]:
p*=i
for i in range(k,len(a)):
q=p//a[i-k]*a[i]
if q>p: print("Yes")
else: print("No")
p=q
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(k,len(a)):
if a[i]>a[i-k]: print("Yes")
else: print("No")
| p02602 |
n, k = list(map(int, input().split()))
a = [int(_) for _ in input().split()]
bef = 1
for i in range(k):
bef *= a[i]
for i in range(k, n):
val = bef // a[i-k] * a[i]
if val > bef:
print('Yes')
else:
print('No')
bef = val
| n, k = list(map(int, input().split()))
a = [int(_) for _ in input().split()]
bef = 0
for i in range(k, n):
val = a[i]
bef = a[i-k]
if val > bef:
print('Yes')
else:
print('No')
bef = val
| p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
s=[1]
for i in range(n):
s.append(s[-1]*a[i])
for i in range(k+1,n+1):
if s[i]/s[i-k]>s[i-1]/s[i-1-k]:
print('Yes')
else:
print('No') | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(k,n):
if a[i]/a[i-k]>1:
print('Yes')
else:
print('No') | p02602 |
N,K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
before = 1
for i in range(K):
before *= A[i]
val = 0
for i in range(K,len(A)):
val = before
val = val / A[i-K] * A[i]
if(val > before):
print("Yes")
else:
print("No")
before = val | N,K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
for i in range(K,N):
if(A[i-K] < A[i]):
print("Yes")
else:
print("No") | p02602 |
N,K = list(map(int,input().split()))
T = list(map(int,input().split()))
Number = []
for j in range(N-K+1):
Num=1
for i in range(K):
Num *=T[i+j]
Number.append(Num)
for p in range(N-K):
if Number[p+1] - Number[p] >0:
print('Yes')
else:
print('No') | N,K = list(map(int,input().split()))
T = list(map(int,input().split()))
for p in range(N-K):
if T[p] - T[p+K] <0:
print('Yes')
else:
print('No')
| p02602 |
N, K =list(map(int,input().split()))
A = list(map(int,input().split()))
ans = []
val = 1
for i in range(K-1):
val *= A[i]
for i in range(K-1,N):
if i==K-1:
val *= A[i]
continue
if val<((val//A[i-K])*A[i]):
ans.append("Yes")
else:
ans.append("No")
val = val//A[i-K]
val *= A[i]
for i in range(len(ans)):
print((ans[i])) | N, K =list(map(int,input().split()))
A = list(map(int,input().split()))
ans = []
for i in range(K,N):
if (A[i]/A[i-K])>1:
ans.append("Yes")
else:
ans.append("No")
for i in range(len(ans)):
print((ans[i])) | p02602 |
n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
a1 = 1
a2 = 1
for i in range(n):
if i < k:
a1 = a1*a[i]
else:
a2 = a1
a1 = a[i]*a1//a[i-k]
if a1 > a2:
print('Yes')
else:
print('No')
| n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(n):
if i < k:
continue
else:
if a[i-k] < a[i]:
print('Yes')
else:
print('No')
| p02602 |
from operator import mul
from functools import reduce
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n-k):
if reduce(mul,a[i:k+i]) < reduce(mul,a[i+1:k+i+1]):
print("Yes")
else:
print("No") | n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n-k):
if a[i] < a[k+i]:
print("Yes")
else:
print("No") | p02602 |
from operator import mul
from functools import reduce
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
before = reduce(mul, A[:k])
for i in range(1, n-k+1):
tmp = reduce(mul, A[i:k+i])
if tmp > before:
print("Yes")
else:
print("No")
before = tmp | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
before = sum(A[:k])
for i in range(n-k):
tmp = before + A[i+k] - A[i]
if tmp > before:
print("Yes")
else:
print("No")
before = tmp | p02602 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
score = 1
for i in range(K):
score *= A[i]
for i in range(K,N):
tmp = score*A[i]/A[i-K]
if score < tmp:
print("Yes")
else:
print("No")
scpre = tmp
| N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(K,N):
if A[i-K] < A[i]:
print("Yes")
else:
print("No")
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
now = a[0]
idx = 0
gabbege = a[idx]
length = 1
for i in range(1, n):
if length < k:
length += 1
now *= a[i]
else:
if now < now // gabbege * a[i]:
print("Yes")
else:
print("No")
now = now // gabbege * a[i]
idx += 1
gabbege = a[idx] | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
now = a[0]
idx = 0
gabbege = a[idx]
length = 1
for i in range(1, n):
if length < k:
length += 1
now += a[i]
else:
if now < now - gabbege + a[i]:
print("Yes")
else:
print("No")
now = now - gabbege + a[i]
idx += 1
gabbege = a[idx] | p02602 |
N,K = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = []
g = 0
for i in range(N-K+1):
k = 1
for s in range(K):
k *= a[s+i]%10**9
ans.append(k)
if len(ans)>1:
if ans[0]<ans[1]:
print("Yes")
else:
print("No")
del ans[0]
| N,K = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(N-K):
if a[i]<a[i+K]:
print("Yes")
else:
print("No") | p02602 |
n,k,*a=list(map(int,open(0).read().split()))
multiple=1
for i in range(k):
multiple*=a[i]
for j in range(n-k):
if a[j+k]>a[j]:
print('Yes')
else:
print('No')
multiple=multiple*a[j+k]/a[j] | n,k,*a=list(map(int,open(0).read().split()))
multiple=1
#for i in range(k):
# multiple*=a[i]
for j in range(n-k):
if a[j+k]>a[j]:
print('Yes')
else:
print('No')
# multiple=multiple*a[j+k]/a[j] | p02602 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from collections import deque
from decimal import *
import queue
input = sys.stdin.readline
def inputInt(): return int(eval(input()))
def inputMap(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N,K = inputMap()
A = inputList()
ans = 1
ans_old = 1
mae = 0
for i,val in enumerate(A):
if i < K:
ans_old *= val
continue
mae = A[i-K]
ans = ans_old
ans = ans / mae * val
if ans > ans_old:
print("Yes")
else:
print("No")
ans_old = ans
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from collections import deque
from decimal import *
import queue
input = sys.stdin.readline
def inputInt(): return int(eval(input()))
def inputMap(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N,K = inputMap()
A = inputList()
ans = 1
ans_old = 1
mae = 0
for i,val in enumerate(A):
if i < K:
continue
tmp = A[i-K]
if val > tmp:
print("Yes")
else:
print("No")
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
main()
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
evaluations = []
for n in range(N):
if n < K-1:
evaluations.append(0)
else:
evaluation = 1
for i in range(K):
evaluation *= A[n-i]
evaluations.append(evaluation)
# print(evaluations)
for n in range(K, N):
print(('Yes' if evaluations[n] > evaluations[n-1] else 'No'))
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for n in range(K, N):
print(('Yes' if A[n] > A[n-K] else 'No'))
| p02602 |
N,K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
ans = [0]*(N-K+1)
score = 1
for i in range(K):
score *= A[i]
for i in range(K, N):
ans[i - K] = score
score //= A[i - K]
score *= A[i]
ans[-1] = score
print(("\n".join(["Yes" if ans[i] > ans[i-1] else "No" for i in range(1,len(ans))]))) | N,K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
ans = ["Yes" if A[i] > A[i - K] else "No" for i in range(K,N)]
print(("\n".join(ans))) | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
S = [1]
for i in range(0, N):
S.append(S[i] * A[i])
count = 0
prev = -1
for i in range(K, N+1):
current = S[i]//S[count]
if prev != -1:
if current > prev:
print("Yes")
else:
print("No")
prev = current
count += 1
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
count = 0
prev = 1
ans = 1
for i in range(0, K):
prev *= A[i]
for i in range(K, N):
ans = prev
ans //= A[count]
ans *= A[i]
if ans > prev:
print("Yes")
else:
print("No")
prev = ans
count += 1
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
count = 0
prev = 1
ans = 1
for i in range(0, K):
prev *= A[i]
for i in range(K, N):
ans = prev
ans //= A[count]
ans *= A[i]
if ans > prev:
print("Yes")
else:
print("No")
prev = ans
count += 1
| N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(N-K):
print(('Yes' if A[i] < A[i+K] else 'No'))
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
hyouten = [1]*n
hyouten[0] = a[0]
for i in range(1, n):
hyouten[i] = hyouten[i-1]*a[i]
#print(hyouten)
for i in range(k+1, n+1):
hyouten[i-1] //= hyouten[i-k-1]
if hyouten[i-1] > hyouten[i-2]:
print("Yes")
else:
print("No")
#print(hyouten) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(k+1, n+1):
if a[i-1] > a[i-k-1]:
print("Yes")
else:
print("No")
| p02602 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
mae = 1
for i in range(K):
mae *= A[i]
for i in range(N-K):
ato = mae/A[i]*A[i+K]
#mae = ato
if ato > mae:
print("Yes")
else:
print("No")
mae = ato
| N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(N-K):
if A[i] < A[i+K]:
print("Yes")
else:
print("No")
| p02602 |
import math
def resolve():
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
dp=[1]*202020
for i in range(K):
dp[K]*=A[i]
for i in range(K+1,N+1):
dp[i]=dp[i-1]/A[i-K-1]*A[i-1]
if(dp[i]>dp[i-1]):
print("Yes")
else:
print("No")
resolve() | import math
def resolve():
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
# dp=[1]*202020
# for i in range(K):
# dp[K]*=A[i]
for i in range(K+1,N+1):
#dp[i]=dp[i-1]/A[i-K-1]*A[i-1]
if(A[i-1]>A[i-K-1]):
print("Yes")
else:
print("No")
resolve()
| p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
count=0
ans=None
d=0
for i in range(n-k+1):
if d==0:
d=1
gakki=1
for j in range(count,k+count):
gakki*=a[j]
else:
gakki/=a[count]
gakki*=a[k+count]
count+=1
if ans is None:
ans=gakki
else:
if ans<gakki:
print('Yes')
ans=gakki
else:
print("No")
ans=gakki | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(n-k):
if a[i]<a[k+i]:
print('Yes')
else:
print("No") | p02602 |
N,K = list(map(int,input().split(' ')))
A = list(map(int,input().split(' ')))
sum_score = A[0]
for i in range(1,K):
sum_score *= A[i]
cnt = 0
for k in range(K-1,N):
prev_sum_score = int(sum_score)
if k + 1 > N - 1:
break
sum_score /= A[cnt]
sum_score *= A[k+1]
cnt += 1
if prev_sum_score >= int(sum_score):
print("No")
else:
print("Yes") | N,K = list(map(int,input().split(' ')))
A = list(map(int,input().split(' ')))
cnt = 0
for k in range(K,N):
if A[k] > A[cnt]:
print("Yes")
else:
print("No")
cnt += 1
| p02602 |
def main():
N, K = list(map(int, input().split()))
A = [1] + list(map(int, input().split()))
for i in range(2, N+1):
A[i] *= A[i-1]
for i in range(K+1, N+1):
cur = A[i]//A[i-K]
prev = A[i-1]//A[i-K-1]
if cur > prev:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| def main():
N, K = list(map(int, input().split()))
A = [1] + list(map(int, input().split()))
for i in range(K+1, N+1):
if A[i] > A[i-K]:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| p02602 |
#C
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
P_before = 1
for k in range(K):
P_before = P_before*A[k]
P_before
for i in range(K,N):
P = P_before*A[i]//A[i-K]
if P > P_before:
print('Yes')
else:
print('No')
P_before = P | #C
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(K,N):
if A[i] > A[i-K]:
print('Yes')
else:
print('No') | p02602 |
n, k = list(map(int, input().split()))
score = list(map(int, input().split()))
mv_scores = []
for i in range(k, n+1):
tmp_score = 1
for s in score[i-k:i]:
tmp_score *= s
mv_scores.append(tmp_score)
for j in range(1, len(mv_scores)):
if mv_scores[j] - mv_scores[j-1] > 0:
print("Yes")
else:
print("No") | n, k = list(map(int, input().split()))
score = list(map(int, input().split()))
for i in range(k, n):
if score[i-k] < score[i]:
print("Yes")
else:
print("No") | p02602 |
from functools import reduce
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
x=reduce(lambda x,y: x*y,l[:k])
temp=[x]
for i in range(k,len(l)):
if l[i]<=l[i-k]:
print('No')
else:
print('Yes')
| n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
for i in range(k,len(l)):
if l[i]<=l[i-k]:
print('No')
else:
print('Yes')
| p02602 |
N, K = list(map(int, input().split()))
list_A = list(map(int, input().split()))
results = []
for i in range(N - K + 1):
result = 1
for j in range(K):
result *= list_A[j + i]
results.append(result)
for i in range(N - K):
if results[i] < results[i + 1]:
print("Yes")
else:
print("No") | N, K = list(map(int, input().split()))
list_A = list(map(int, input().split()))
for i in range(N - K):
if list_A[i] < list_A[i + K]:
print("Yes")
else:
print("No") | p02602 |
import sys
input = sys.stdin.readline
def main():
n,k = list(map(int, input().split()))
A = list(map(int, input().split()))
score = 1
for a in A[:k]:
score*=a
for i in range(k,n):
tmp_score = score//A[i-k] * A[i]
if tmp_score > score:
print("Yes")
else:
print('No')
score = tmp_score
main() | import sys
input = sys.stdin.readline
def main():
n,k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(k,n):
if A[i] > A[i-k]:
print('Yes')
else:
print('No')
main() | p02602 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
b = 1
for i in A[0:K]:
b *= i
for i in range(N-K):
a = b/A[i]*A[i+K]
if b < a :
print("Yes")
else:
print("No")
b = a
| N, K = map(int, input().split())
A = list(map(int, input().split()))
result = []
for i in range(K, N):
if A[i] > A[i - K]:
result.append('Yes')
else:
result.append('No')
print(*result, sep='\n')
| p02602 |
from functools import reduce
from operator import mul
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
num = reduce(mul, a[:k])
for i in range(k, n):
num2 = num*a[i]//a[i-k]
if num < num2:
print('Yes')
else:
print('No')
num = num2 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(k, n):
if a[i]/a[i-k] > 1:
print('Yes')
else:
print('No') | p02602 |
#!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools, bisect
import math, fractions
import sys, copy
def L(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline().rstrip())
def S(): return list(sys.stdin.readline().rstrip())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def LIR1(n): return [LI1() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
def LR(n): return [L() for _ in range(n)]
alphabets = "abcdefghijklmnopqrstuvwxyz"
sys.setrecursionlimit(1000000)
dire = [[1, 0], [0, 1], [-1, 0], [0, -1]]
dire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]
MOD = 1000000007
def main():
N, K = LI()
A = LI()
cum = [1] * (N + 1)
val = []
for i in range(N):
cum[i+1] = cum[i] * A[i]
for i in range(K, N+1):
val.append(cum[i] // cum[i - K])
for i in range(N-K):
print(("Yes" if val[i+1] > val[i] else "No"))
if __name__ == '__main__':
main() | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools, bisect
import math, fractions
import sys, copy
def L(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline().rstrip())
def S(): return list(sys.stdin.readline().rstrip())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def LIR1(n): return [LI1() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
def LR(n): return [L() for _ in range(n)]
alphabets = "abcdefghijklmnopqrstuvwxyz"
sys.setrecursionlimit(1000000)
dire = [[1, 0], [0, 1], [-1, 0], [0, -1]]
dire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]
MOD = 1000000007
def main():
N, K = LI()
A = LI()
for i in range(K, N):
print(("Yes" if A[i] > A[i - K] else "No"))
if __name__ == '__main__':
main() | p02602 |
def main():
n, k = [int(e) for e in input().split()]
A = [int(e) for e in input().split()]
s = A[0]
for i in range(1, k):
s *= A[i]
prev = s
for i in range(n - k):
s //= A[i]
s *= A[k + i]
if prev < s:
print('Yes')
else:
print('No')
prev = s
if __name__ == '__main__':
main()
| def main():
n, k = [int(e) for e in input().split()]
A = [int(e) for e in input().split()]
for i in range(n - k):
if A[i] < A[k + i]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
l=[0]*(n+1)
l[0]=1
l[1]=a[0]
for i in range(2,n+1):
l[i]=l[i-1]*a[i-1]
#print(l)
grade=[0]*(n-k+1)
for i in range(n-k+1):
grade[i]=l[i+k]//l[i]
#print(grade)
for i in range(n-k):
if grade[i]<grade[i+1]:
print("Yes")
else:
print("No") | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
l=[0]*(n-k)
for i in range(n-k):
l[i]=a[i+k]/a[i]
for i in range(n-k):
if l[i]>1:
print("Yes")
else:
print("No") | p02602 |
import io
import os
from collections import Counter, defaultdict, deque
def solve(N, K, A):
window = deque()
val = 1
grades = []
for x in A:
window.append(x)
val *= x
if len(window) > K:
val //= window.popleft()
if len(window) == K:
grades.append(val)
ans = []
for x, y in zip(grades, grades[1:]):
if x < y:
ans.append("Yes")
else:
ans.append("No")
return "\n".join(ans)
if __name__ == "__main__":
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
ans = solve(N, K, A)
print(ans)
| import io
import os
from collections import Counter, defaultdict, deque
def solve(N, K, A):
window = deque()
ans = []
for x in A:
window.append(x)
if len(window) > K:
if window.popleft() < x:
ans.append("Yes")
else:
ans.append("No")
return "\n".join(ans)
if __name__ == "__main__":
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
ans = solve(N, K, A)
print(ans)
| p02602 |
from operator import mul
from functools import reduce
N, K = list(map(int,input().split()))
A = list(map(int, input().split()))
hyouten_count = N - K
result_list = []
result = 1
for i in range(K-1, N):
# print(num)
# result = 1
num = i-K+1
result = reduce(mul, A[num:i+1])
# for j in range(K):
# result = result * A[i - j]
# print(result)
# print(result)
result_list.append(result)
result = 1
for n in range(1, len(result_list)):
if result_list[n] > result_list[n-1]:
print('Yes')
else:
print('No') | N, K = list(map(int,input().split()))
A = list(map(int, input().split()))
for i in range(K, N): # 3, 5
if A[i] > A[i-K]:
print('Yes')
else:
print('No')
| p02602 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
R = [1]
for i in range(n):
R.append(R[-1] * A[i])
prev = R[k]
for i in range(k + 1, n + 1):
now = R[i] // R[i - k]
print(("Yes" if prev < now else "No"))
prev = now
if __name__ == '__main__':
resolve()
| import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(k, n):
prev = A[i - k]
now = A[i]
print(("Yes" if prev < now else "No"))
if __name__ == '__main__':
resolve()
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = ['No' for i in range(n - k)]
pre = 1
cur = 1
for i in range(k):
pre *= a[i]
for i in range(1, n - k + 1):
cur = (pre // a[i - 1]) * a[i + k-1]
if cur > pre:
ans[i - 1] = 'Yes'
pre = cur
for i in ans:
print(i)
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = ['No' for i in range(n - k)]
for i in range(n - k):
if a[i] < a[i + k]:
ans[i] = 'Yes'
for i in ans:
print(i)
| p02602 |
n ,k = list(map(int, input().split()))
lis = list(map(int, input().split()))
t = sum(lis[:k])
for i in range(k, n):
a = sum(lis[i-k+1:i+1])
if a > t:
print('Yes')
else:
print('No')
t = a
a = 0 | n ,k = list(map(int, input().split()))
lis = list(map(int, input().split()))
for i in range(k, n):
l = lis[i-k]
r = lis[i]
if r > l:
print('Yes')
else:
print('No') | p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
score=1
s=[]
for i in range(k,n+1):
for j in range(k):
score*=a[i-k+j]
s.append(score)
score=1
#print(s)
for i in range(n-k):
if (s[i+1]-s[i])>0:
print('Yes')
else:
print('No') | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(k,n):
if a[i]>a[i-k]:
print('Yes')
else:
print('No') | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = [0] * (N)
temp = 1
for i in range(K):
temp *= A[i]
ans[K - 1] = temp
for i in range(K, N):
ans[i] = ans[i - 1] * A[i] // A[i - K]
if ans[i] > ans[i - 1]:
print('Yes')
else:
print('No')
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = [0] * (N)
temp = 1
# for i in range(K):
# temp *= A[i]
# ans[K - 1] = temp
for i in range(K, N):
if A[i] > A[i - K]:
# ans[i] = ans[i - 1] * A[i] // A[i - K]
# if ans[i] > ans[i - 1]:
print('Yes')
else:
print('No')
| p02602 |
import sys
from itertools import accumulate
import operator as op
input = sys.stdin.readline
n,k=list(map(int,input().split()))
L=list(map(int,input().split()))
N=[1]+list(accumulate(L,op.mul))
ans=[]
for i in range(k,n+1):
val = N[i]/N[i-k]
ans.append(val)
N=len(ans)
for i in range(1,N):
if ans[i]>ans[i-1]:
print('Yes')
else:
print('No')
| import sys
input = sys.stdin.readline
n,k=list(map(int,input().split()))
L=list(map(int,input().split()))
ans=[]
for i in range(k,n):
if L[i]>L[i-k]:
print('Yes')
else:
print('No')
| p02602 |
import sys
input = lambda: sys.stdin.readline().rstrip()
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
now = 1
for i in range(k):
now *= a[i]
before = now
for i in range(n - k):
now *= a[i + k]
now /= a[i]
if now > before:
print('Yes')
else:
print('No')
before = now
| import sys
input = lambda: sys.stdin.readline().rstrip()
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
now = 1
# for i in range(k):
# now *= a[i]
# before = now
for i in range(n - k):
# now *= a[i + k]
# now /= a[i]
if a[i] < a[i + k]:
print('Yes')
else:
print('No')
# before = now
| p02602 |
import functools
import operator
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
old_score = 1
new_score = 1
for i in range(n - k + 1): #iはスタート地点
old_score = new_score
new_score = 1
list_ = A[i: i + k] #Aのj番目の要素をかける
new_score = functools.reduce(operator.mul, list_)
if i != 0 and old_score < new_score:
print("Yes")
elif i != 0 and old_score >= new_score:
print("No") | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(n - k): #iはスタート地点
old = A[i] #Aのj番目の要素をかける
new = A[i + k]
if old < new:
print("Yes")
else:
print("No") | p02602 |
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
n,k = readInts()
a = readInts()
base = 1
for i in range(k):
base*=a[i]
t = base
#print(t)
base = base//a[0]
for i in range(k,n):
base*=a[i]
#print(base)
if t>=base:
print("No")
else:
print("Yes")
t = base
base=base//a[i-k+1]
| from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
n,k = readInts()
a = readInts()
t = a[0]
for i in range(k,n):
be = a[i-k]
af = a[i]
#print(base)
if be>=af:
print("No")
else:
print("Yes")
| p02602 |
N, K = [int(a) for a in input().split()]
A = [int(a) for a in input().split()]
marks = []
prev = 1
for k in range(K):
prev = (prev * A[K-1-k])
# print(prev)
for i in range(K, N):
# print('div', i, K, i-K)
prod = A[i]*(prev//A[i-K])
if prev != -1:
if prev < prod:
print('Yes')
else:
print('No')
prev = prod | N, K = [int(a) for a in input().split()]
A = [int(a) for a in input().split()]
marks = []
for i in range(K, N):
prev = A[i-K]
next_ = A[i]
if prev < next_:
print('Yes')
else:
print('No') | p02602 |
from collections import deque
def main():
n, k = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
scores_q = deque(scores)
news = deque(scores[k:])
former = 0
rank = 1
for score in scores[:k]:
rank *= score
for shift in range(n - k):
former = rank
remover = scores_q.popleft()
new_commer = news.popleft()
rank //= remover
rank *= new_commer
if former < rank:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| def main():
n, k = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
for remover, new_commer in zip(scores, scores[k:]):
if remover < new_commer:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| p02602 |
def main():
n, k = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
for index in range(n - k):
if scores[index] < scores[index + k]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| def main():
n, k = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
for index, new in enumerate(scores[k:]):
if scores[index] < new:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| p02602 |
def main():
n, k = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
# zip にすると2つのリストを作るのか，これよりも少し時間とメモリ増。
{
print('Yes' if scores[index] < new else 'No')
for index, new in enumerate(scores[k:])}
if __name__ == '__main__':
main()
| def main():
n, k = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
for index, new in enumerate(scores[k:]):
# zip にすると2つのリストを作るのか，これよりも少し時間とメモリ増。
print(('Yes' if scores[index] < new else 'No'))
if __name__ == '__main__':
main()
| p02602 |
def main():
n, k = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
for index, new in enumerate(scores[k:]):
# zip にすると2つのリストを作るのか，これよりも少し時間とメモリ増。
print(('Yes' if scores[index] < new else 'No'))
if __name__ == '__main__':
main()
| def main():
n, k = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
# zip にすると2つのリストを作るのか，これよりも少し時間とメモリ増。
print(('\n'.join('Yes' if scores[index] < new else 'No'
for index, new in enumerate(scores[k:]))))
if __name__ == '__main__':
main()
| p02602 |
#MSOL C 修正
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
ynlist = []
def checker(i):
l1 = A[i-K+1:i:]
i1 = A[i-K]
i2 = A[i]
if i1 < i2:
return "Yes"
else:
return "No"
for i in range(K,N):
print((checker(i))) | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(K,N):
if A[i-K] < A[i]:
print("Yes")
else:
print("No") | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt = 1
for i in range(n):
cnt*=a[i]
if i>=k:
m = cnt//a[i]
cnt//=a[i-k]
if cnt>m: print('Yes')
else: print('No') | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n):
if i>=k:
if a[i]>a[i-k]: print('Yes')
else: print('No')
| p02602 |
import sys
N, K = list(map(int, input().split()))
def input():
return sys.stdin.readline()[:-1]
A = list(map(int, input().split()))
hyouten = [0] * (N)
# 評点計算
for i in range(K-1, N):
if i == K - 1:
tmp = A[i]
for j in range(1,K):
tmp *= A[i-j]
else:
tmp //= A[i-K]
tmp *= A[i]
hyouten[i] = tmp
for i in range(K, N):
if hyouten[i] > hyouten[i-1]:
print('Yes')
else:
print("No")
| import sys
N, K = list(map(int, input().split()))
def input():
return sys.stdin.readline()[:-1]
A = list(map(int, input().split()))
for i in range(K, N):
if A[i-K] < A[i]:
print('Yes')
else:
print("No")
| p02602 |
n, k = list(map(int, input().split()))
items = list(input().split())
def main():
for i in range(k+1, n+1):
sum_prev, sum_next = (1, 1)
for j in range(i-k-1, i-1):
sum_prev *= int(items[j])
sum_next *= int(items[j+1])
if (sum_prev < sum_next):
print("Yes")
else:
print("No")
main()
| n, k = list(map(int, input().split()))
items = list(input().split())
for i in range(k, n):
if (int(items[i]) > int(items[i-k])):
print("Yes")
else:
print("No")
| p02602 |
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
count = 0
for i in range(N - K + 1):
kake_A = 1
for j in range(K):
kake_A = kake_A * A[j + i]
count = count + 1
if count == 1:
kake_B = kake_A
continue
else:
if kake_A > kake_B:
print('Yes')
else:
print('No')
kake_B = kake_A | N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
count = 0
for i in range(N - K):
kake_A = A[i]
kake_B = A[i + K]
if kake_A >= kake_B:
print('No')
else:
print('Yes') | p02602 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.