input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = eval(input())
N = int(N)
l = [int(eval(input())) for i in range(N)]
flg = 1
ma = 0
for i in range(0,len(l)-1):
for j in range(i+1,len(l)):
if(ma < l[j]-l[i] or flg ==1):
ma = l[j] - l[i]
flg = 0
print(ma)
| N = eval(input())
N = int(N)
l = [int(eval(input())) for i in range(N)]
flg = 1
ma = 0
mi = 0
for i in range(1,len(l)):
if(mi > l[i-1] or flg ==1):
mi = l[i-1]
if(ma < l[i] - mi or flg ==1):
ma = l[i] - mi
flg = 0
print(ma)
| p02258 |
cnt = int(eval(input()))
v = []
for i in range(cnt):
v.append(int(eval(input())))
len = len(v)
dif_max = -1000000000
for i in range(len):
for j in range(i + 1, len, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print(dif_max) | cnt = int(eval(input()))
dif_max = -1000000000
v_min = 1000000000
for i in range(cnt):
buf = int(eval(input()))
if i > 0:
dif_max = dif_max if buf - v_min < dif_max else buf - v_min
v_min = buf if buf < v_min else v_min
print(dif_max) | p02258 |
x = int(eval(input()))
l=[]
for i in range(x):
l.append(int(eval(input())))
max_ = -99999999999999999999999
for i, v1 in enumerate(l):
for j, v2 in enumerate(l):
if j > i:
if v2-v1 > max_:
max_ = v2-v1
print(max_) | x = int(eval(input()))
l=[]
for i in range(x):
l.append(int(eval(input())))
MIN = 999999999999999999999999999999999999999
MAX = -9999999999999999999999999999999999999
for i in l:
if i - MIN > MAX:
MAX = i - MIN
if i < MIN:
MIN = i
print(MAX) | p02258 |
n = int(eval(input()))
ls = [int(eval(input())) for _ in range(n)]
p = min(ls) - max(ls)
for i, x in enumerate(ls, 1):
if i == len(ls):
break
v = max(ls[i:]) - x
if v > p:
p = v
print(p)
| n = int(eval(input()))
m = [int(eval(input())) for _ in range(n)]
def fx(raw):
min_n = raw[0]
max_n = raw[1] - raw[0]
for i in raw[1:]:
if i - min_n >= max_n:
max_n = i - min_n
if i < min_n:
min_n = i
return max_n
if __name__ == '__main__':
print((fx(m)))
| p02258 |
def set_values():
values = []
for i in range(int(eval(input()))):
values.append(int(eval(input())))
return values
def check_all(values):
max_value = min(values) - max(values)
for i in range(len(values)-1):
count = i + 1
max_value = get_max_value(i, len(values), count, max_value)
return max_value
def get_max_value(now_index, length, count, max_value):
while count < length:
if max_value < (values[count] - values[now_index]):
max_value = (values[count] - values[now_index])
count += 1
return max_value
values = set_values()
max_value = check_all(values)
print(max_value)
| def set_values():
values = []
for i in range(num):
values.append(int(eval(input())))
return values
num = int(eval(input()))
values = set_values()
max_value = values[1] - values[0]
min_value = values[0]
for i in range(1, num):
max_value = max(max_value, (values[i] - min_value))
min_value = min(min_value, values[i])
print(max_value)
| p02258 |
n=int(eval(input()))
R=[int(eval(input())) for i in range(n)]
mini=10**10
maxi=-10**10
for r in R:
maxi=max([maxi,r-mini])
mini=min([mini,r])
print(maxi)
| N = int(eval(input()))
A = [int(eval(input())) for n in range(N)]
B, C = [], []
m = 10 ** 9
M = 0
for n in range(N):
if A[n] < m:
m = A[n]
if A[N - n - 1] > M:
M = A[N - n - 1]
B.append(m)
C.append(M)
C.reverse()
D = [C[n+1] - B[n] for n in range(N-1)]
print((max(D)))
| p02258 |
n = int(eval(input()))
ps = [int(eval(input())) for _ in range(n)]
maxpro = -9999999999
for i, p in enumerate(ps[:-1]):
pro = max(ps[i + 1:]) - p
maxpro = max(pro, maxpro)
print(maxpro) | n = int(eval(input()))
ps = [int(eval(input())) for _ in range(n)]
maxpro = -999999999
minp = 1000000000
for i, p in enumerate(ps[:-1]):
if p >= minp: continue
pro = max(ps[i + 1:]) - p
maxpro = max(pro, maxpro)
minp = p
print(maxpro) | p02258 |
n = int(eval(input()))
R = [int(eval(input())) for _ in range(n)]
ans = R[1] - R[0]
bottom = min(R[0], R[1])
for r in R[2:]:
ans = max(ans, r - bottom)
bottom = min(bottom, r)
print(ans) | n = int(eval(input()))
R = [int(eval(input())) for _ in range(n)]
ans = R[1] - R[0]
bottom = min(R[0], R[1])
for r in R[2:]:
ans = max(ans, r - bottom)
if r < bottom:
bottom = r
print(ans) | p02258 |
n = int(eval(input()))
a = [0]*n
for i in range(n):
a[i] = int(eval(input()))
max = a[1]-a[0]
for i in range(2,n):
for j in range(0,i):
tmp = a[i]-a[j]
if max<tmp:
max = tmp
print(max)
| n = int(eval(input()))
a = [0]*n
for i in range(n):
a[i] = int(eval(input()))
max = a[1]-a[0]
min = a[0]
for i in range(1,n):
if max < (a[i]-min):
max = (a[i]-min)
if min > a[i]:
min = a[i]
print(max)
| p02258 |
import sys
values = [int(eval(input())) for i in range(int(eval(input())))]
maxv = - sys.maxsize - 1
for c, i in enumerate(values):
for j in values[c + 1:]:
maxv = max(maxv, j - i)
print(maxv)
| n = int(eval(input()))
R = [int(eval(input())) for _ in range(n)]
minv, maxv = R[0], R[1]-R[0]
for j in range(1, n):
maxv = max(maxv, R[j]-minv)
minv = min(minv, R[j])
print(maxv)
| p02258 |
n = int(eval(input()))
R = [int(eval(input())) for _ in range(n)]
minv, maxv = R[0], R[1]-R[0]
for j in range(1, n):
maxv = max(maxv, R[j]-minv)
minv = min(minv, R[j])
print(maxv)
| values = [int(eval(input())) for _ in range(int(eval(input())))]
maxv = values[1] - values[0]
minv = values[0]
for val in values[1:]:
maxv = max(maxv, val - minv)
minv = min(minv, val)
print(maxv)
| p02258 |
t = []
n = int(eval(input()))
for i in range(n):
t.append(int(eval(input())))
'''
n = 6
t=[4,1,5,7,5,4]
'''
maxv = t[1] - t[0]
for j in range(1,n):
for i in range(j):
maxv = max([maxv,t[j] - t[i]])
print(maxv) | t = []
n = int(eval(input()))
for i in range(n):
t.append(int(eval(input())))
'''
n = 6
t=[4,1,5,7,5,4]
'''
minv = t[0]
maxv = t[1] - t[0]
for j in range(1,n):
maxv = max([maxv,t[j] - minv])
minv = min([minv,t[j]])
print(maxv) | p02258 |
a = []
n = int(eval(input()))
for i in range(n):
a.append(int(eval(input())))
print((max(max(a[i:])-min(a[:i]) for i in range(1, n)))) | maxv = -2*10**9
minv = 2*10**9
n = int(eval(input()))
for i in range(n):
x = int(eval(input()))
maxv = max(x - minv, maxv)
minv = min(x, minv)
print(maxv) | p02258 |
r = []
n = int(eval(input()))
for i in range(n):
i = int(eval(input()))
r.append(i)
maxv = r[1] - r[0]
for j in range(1,n):
for i in range(j):
maxv = max(maxv, r[j]-r[i])
print(maxv)
| '''
Rjの最小値を保持することで最大利益の更新判定をn回で終わらせる
'''
r = []
n = int(eval(input()))
for i in range(n):
i = int(eval(input()))
r.append(i)
minv = r[0]
maxv = r[1] - r[0]
for j in range(1,n):
maxv = max(maxv, r[j]-minv)
minv = min(minv, r[j])
print(maxv)
| p02258 |
# -*- coding: utf-8 -*-
import sys
import os
import math
N = int(eval(input()))
lst = []
for i in range(N):
lst.append(int(eval(input())))
max_diff = lst[1] - lst[0]
for i in range(N):
for j in range(i + 1, N):
diff = lst[j] - lst[i]
if diff > max_diff:
max_diff = diff
print(max_diff) | # -*- coding: utf-8 -*-
import sys
import os
import math
N = int(eval(input()))
lst = []
for i in range(N):
lst.append(int(eval(input())))
max_profit = lst[1] - lst[0]
min_value = min(lst[0], lst[1])
for i in range(2, N):
price = lst[i]
max_profit = max(max_profit, price - min_value)
min_value = min(min_value, price)
print(max_profit) | p02258 |
n = int(eval(input()))
stack = []
for _ in range(n):
stack.append(int(eval(input())))
candidate = [-float('inf')]
for i in range(1, len(stack) // 2 + 1):
for r1, r2 in zip(stack[::1], stack[i::1]):
candidate.append(r2 - r1)
for r1, r2 in zip(stack[::1], stack[len(stack) - i::1]):
candidate.append(r2 - r1)
candidate = [max(candidate)]
print((candidate[0])) | n = int(eval(input()))
stack = []
for _ in range(n):
stack.append(int(eval(input())))
candidate = [-float('inf')]
for i in range(1, len(stack) // 2 + 1):
for r1, r2 in zip(stack[::1], stack[i::1]):
if r2 - r1 > candidate[0]:
candidate.append(r2 - r1)
for r1, r2 in zip(stack[::1], stack[len(stack) - i::1]):
if r2 - r1 > candidate[0]:
candidate.append(r2 - r1)
candidate = [max(candidate)]
print((candidate[0])) | p02258 |
n = int(eval(input()))
stack = []
for _ in range(n):
stack.append(int(eval(input())))
length = len(stack)
candidate = [-float('inf')]
for i in range(1, length // 2 + 1):
for r1, r2 in zip(stack[::1], stack[i::1]):
if r2 - r1 > candidate[0]:
candidate.append(r2 - r1)
if i - length != i:
for r1, r2 in zip(stack[::1], stack[length - i::1]):
if r2 - r1 > candidate[0]:
candidate.append(r2 - r1)
candidate = [max(candidate)]
print((candidate[0])) | n = int(eval(input()))
stack = []
for _ in range(n):
stack.append(int(eval(input())))
maxv = -10**9
minv = stack[0]
for i in range(1, len(stack)):
maxv = max(maxv, stack[i] - minv)
minv = min(minv, stack[i])
print(maxv) | p02258 |
def main():
n = int(eval(input()))
r = []
ans = 0
for i in range(n):
r.append(int(eval(input())))
ans = min(r) - max(r)
for i in reversed(list(range(1, n))):
tmpr = r[:i]
tmp = r[i] - min(tmpr)
if tmp > ans:
ans = tmp
print(ans)
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
ans = 0
minr = int(eval(input()))
ans = -1 * 10**9
for i in range(n-1):
r = int(eval(input()))
ans = max(ans, r-minr)
minr = min(minr, r)
print(ans)
if __name__ == '__main__':
main()
| p02258 |
n = int(eval(input()))
R = []
for i in range(n):
R.append(int(eval(input())))
# R???i???????????§???????°???????i?????????????´???¨???????????????list
mins = [R[0]]
for i in range(1, n):
mins.append(min(R[i], mins[i-1]))
# ???????????????j????????????????????\??????????°??????¨??????????±?????????????????????§???????±????????????????
mx = - 10 ** 12
for j in range(1, n):
mx = max(mx, R[j] - mins[j-1])
print(mx) | n = int(eval(input()))
# R[0]
minv = int(eval(input()))
maxv = - 10 ** 10
# R[1..N-1]
for j in range(1, n):
r = int(eval(input()))
maxv = max(maxv, r - minv)
minv = min(minv, r)
print(maxv) | p02258 |
n = int(eval(input()))
minv = int(eval(input()))
maxv = -1000000000
for i in range(1,n):
r = int(eval(input()))
maxv = max(maxv,r-minv)
minv = min(r,minv)
print(maxv) | n = int(eval(input()))
minv = int(eval(input()))
maxv = -1000000000
for i in range(1,n):
r = int(eval(input()))
m = r-minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv) | p02258 |
n = int(eval(input()))
minv = int(eval(input()))
maxv = -1000000000
for i in range(1,n):
r = int(eval(input()))
m = r-minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv) | import sys
n = int(eval(input()))
minv = int(eval(input()))
maxv = -1000000000
for r in map(int,sys.stdin.readlines()):
m = r-minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv) | p02258 |
n = int(eval(input()))
nums = [int(eval(input())) for i in range(n)]
ans = -10000000000
for i in range(1, n):
temp_max = nums[i:n+1]
temp_min = nums[0:i]
ans = max(ans, max(temp_max) - min(temp_min))
print(ans) | n = int(eval(input()))
nums = [int(eval(input())) for i in range(n)]
temp = nums[1] - nums[0]
p = nums[0]
for i in nums[1:]:
if i - p > temp:
temp = i- p
if i < p:
p = i
print(temp) | p02258 |
input_profit = []
for x in range(eval(input())):
input_profit.append(eval(input()))
max_profit=input_profit[1]-input_profit[0]
for i in range(len(input_profit)-1):
min_profit = input_profit[i]
candidate = max(input_profit[i+1:])-min_profit
if candidate>max_profit:
max_profit=candidate
print(max_profit) | input_n = eval(input())
price1 = eval(input())
price2 = eval(input())
min_price = min(price1,price2)
max_profit = price2-price1
for i in range(input_n-2):
input_profit = eval(input())
tmp = input_profit-min_price
if max_profit<tmp:
max_profit = tmp
if min_price>input_profit:
min_price = input_profit
print(max_profit) | p02258 |
from sys import stdin
n = int(eval(input()))
r=[int(eval(input())) for i in range(n)]
rv = r[::-1][:-1]
m = None
for j,r_j in enumerate(rv):
r_i = min(r[:-(j+1)])
t = r_j - r_i
if m == None or t > m:
m = t
print(m) | from sys import stdin
n = int(eval(input()))
r=[int(eval(input())) for i in range(n)]
rv = r[::-1][:-1]
m = None
p_r_j = None
for j,r_j in enumerate(rv):
if p_r_j == None or p_r_j < r_j:
p_r_j = r_j
if p_r_j > r_j:
continue
r_i = min(r[:-(j+1)])
t = r_j - r_i
if m == None or t > m:
m = t
print(m) | p02258 |
from sys import stdin
n = int(eval(input()))
r=[int(eval(input())) for i in range(n)]
rv = r[::-1][:-1]
m = None
p_r_j = None
for j,r_j in enumerate(rv):
if p_r_j == None or p_r_j < r_j:
p_r_j = r_j
if p_r_j > r_j:
continue
r_i = min(r[:-(j+1)])
t = r_j - r_i
if m == None or t > m:
m = t
print(m) | n = int(eval(input()))
minv = int(eval(input()))
maxv = -2*10**9
for i in range(n-1):
r = int(eval(input()))
maxv = max(maxv,r-minv)
minv = min(minv,r)
print(maxv) | p02258 |
N = int(eval(input()))
a = []
for i in range(N):
a.append(int(eval(input())))
mx = -10**12
for j in range(1, N):
for i in range(j):
mx = max(mx, a[j] - a[i])
print(mx) | N = int(eval(input()))
a = []
for i in range(N):
a.append(int(eval(input())))
mins = [a[0]]
for i in range(1, N):
mins.append(min(a[i], mins[i-1]))
mx = -10**12
for j in range(1, N):
mx = max(mx, a[j] - mins[j-1])
print(mx) | p02258 |
n = int(eval(input()))
R = [0]*n
for i in range(n):
R[i] = int(eval(input()))
maximum_profit = -10**9
for i in range(1, n):
profit = max(R[i:n]) - min(R[0:i])
maximum_profit = profit if profit > maximum_profit else maximum_profit
print(maximum_profit) | debug = False
if debug:import time
if debug:start = time.time()
n = int(eval(input()))
R = [0]*n
R_min = 10**9
for i in range(n):
R[i] = int(eval(input()))
maximum_profit = -10**9
for i in range(1, n):
R_min = R[i-1] if R[i-1] < R_min else R_min
profit = R[i] - R_min
maximum_profit = profit if profit > maximum_profit else maximum_profit
print(maximum_profit)
if debug:print((time.time() - start)) | p02258 |
debug = False
if debug:import time
if debug:start = time.time()
n = int(eval(input()))
R = [0]*n
R_min = 10**9
for i in range(n):
R[i] = int(eval(input()))
maximum_profit = -10**9
for i in range(1, n):
R_min = R[i-1] if R[i-1] < R_min else R_min
profit = R[i] - R_min
maximum_profit = profit if profit > maximum_profit else maximum_profit
print(maximum_profit)
if debug:print((time.time() - start)) | debug = False
if debug:import time
if debug:start = time.time()
n = int(eval(input()))
R = [0]*n
R_min = 10**9
R = [int(eval(input())) for i in range(n)]
maximum_profit = -10**9
for i in range(1, n):
R_min = R[i-1] if R[i-1] < R_min else R_min
profit = R[i] - R_min
maximum_profit = profit if profit > maximum_profit else maximum_profit
print(maximum_profit)
if debug:print((time.time() - start)) | p02258 |
debug = False
if debug:import time
if debug:start = time.time()
n = int(eval(input()))
R = [0]*n
R_min = 10**9
R = [int(eval(input())) for i in range(n)]
maximum_profit = -10**9
for i in range(1, n):
R_min = R[i-1] if R[i-1] < R_min else R_min
profit = R[i] - R_min
maximum_profit = profit if profit > maximum_profit else maximum_profit
print(maximum_profit)
if debug:print((time.time() - start)) | n = int(eval(input()))
maximum_profit = -10**9
r0 = int(eval(input()))
r_min = r0
for i in range(1, n):
r1 = int(eval(input()))
if r0 < r_min:
r_min = r0
profit = r1 - r_min
if profit > maximum_profit:
maximum_profit = profit
r0 = r1
print(maximum_profit) | p02258 |
n = int(eval(input()))
R = [int(eval(input())) for i in range(n)]
maxv = R[1] - R[0]
for i in range(0, n-1):
for j in range(i+1, n):
maxv = R[j] - R[i] if R[j] - R[i] > maxv else maxv
print(maxv) | n = int(eval(input()))
R = [int(eval(input())) for i in range(n)]
maxv = R[1] - R[0]
minv = R[0]
for j in range(1, n):
maxv = R[j] - minv if R[j] - minv > maxv else maxv
minv = R[j] if R[j] < minv else minv
print(maxv) | p02258 |
def max_benefit(num_list):
max_num = 10**9*-1
min_num = num_list[0]
for i in range(1,len(num_list)):
max_num = max(max_num,num_list[i]-min_num)
min_num = min(num_list[i],min_num)
return max_num
n = int(eval(input()))
num_list = []
for _ in range(n):
num_list.append(int(eval(input())))
ans = max_benefit(num_list)
print(ans)
| n = int(eval(input()))
num_list = [int(eval(input())) for _ in range(n)]
max_num = 10**9*-1
min_num = num_list[0]
for i in range(1,len(num_list)):
max_num = max(num_list[i]-min_num,max_num)
min_num = min(num_list[i],min_num)
print(max_num)
| p02258 |
N = eval(input())
nums = []
for i in range(N):
nums.append(eval(input()))
profit = nums[1] - nums[0]
for a in range(N):
for b in range(a):
if (nums[a] - nums[b]) > profit:
profit = nums[a] - nums[b]
print(profit) | N = eval(input())
nums = []
for i in range(N):
nums.append(eval(input()))
profit = nums[1] - nums[0]
min = nums[0]
for a in range(1, N):
if nums[a] - min > profit:
profit = nums[a] - min
if nums[a] < min:
min = nums[a]
print(profit) | p02258 |
N = int(eval(input()))
R = [int(eval(input())) for _ in range(N)]
ret = R[1] - R[0]
for i in range(N - 1):
tmp = max(R[i + 1:]) - R[i]
if tmp > ret:
ret = tmp
print(ret) | N = int(eval(input()))
R = [int(eval(input())) for _ in range(N)]
p_buy = R[0]
p_sale = R[1]
buy = R[1]
sale = None
for i in range(2, N):
if p_sale < R[i]:
p_sale = R[i]
if buy > R[i]:
if sale is None:
sale = R[i]
if p_sale - p_buy < sale - buy:
p_sale, p_buy = sale, buy
sale, buy = None, R[i]
else:
if sale is None or sale < R[i]:
sale = R[i]
p_gain = p_sale - p_buy
print((p_gain if sale is None else max(p_gain, sale - buy))) | p02258 |
n = eval(input())
maxv = - 1 * pow(10, 9)
minv = eval(input())
for _ in range(1, n):
Rj = eval(input())
maxv = max(maxv, Rj - minv)
minv = min(minv, Rj)
print(maxv) | import sys
n = eval(input())
minv = eval(input())
maxv = - 1000000000
nums = list(map(int, sys.stdin.readlines()))
for num in nums:
maxv = num - minv if num - minv > maxv else maxv
minv = num if num < minv else minv
print(maxv) | p02258 |
import math
A = []
N = int(eval(input()))
maxdiff = 0
for n in range(N):
A.append(int(eval(input())))
S = tuple(A)
Smax = ((S[i]-min(S[:i])) for i in range(1, N))
print((max(Smax))) | import math
A = []
N = int(eval(input()))
maxdiff = 0
for n in range(N):
A.append(int(eval(input())))
R = tuple(A)
Dmax = R[1] -R[0]
Rmin = R[0]
for i in range(1, N):
if R[i] >= R[i-1]:
if R[i] - Rmin > Dmax:
Dmax = R[i] -Rmin
if R[i] < Rmin:
Rmin = R[i]
# print(R[i], Dmax, Rmin)
print(Dmax) | p02258 |
ans = -float('inf')
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
for i in range(n):
for j in range(n):
if i >= j:
continue
ans = max(a[j]-a[i], ans)
print(ans) | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
minr = a[0]
ans = -float('inf')
for i in range(1, n):
ans = max(a[i]-minr, ans)
minr = min(a[i], minr)
print(ans) | p02258 |
R = [0 for i in range(0,200000)]
n = int(input())
for i in range(n):
R[i] = int(eval(input()))
maxv = -2000000000
minv = R[0]
for j in range(1, n):
maxv = max(maxv, R[j]-minv)
minv = min(minv, R[j])
print(maxv) | n = int(input())
R = [eval(input()) for i in range(n)]
maxv = -2000000000
minv = R[0]
for j in range(1, n):
maxv = max(maxv, R[j]-minv)
minv = min(minv, R[j])
print(maxv) | p02258 |
from collections import deque
def main():
d = deque()
for _ in range(int(eval(input()))):
d.append(int(eval(input())))
result = min(d) - max(d)
while d:
c = d.popleft()
if not d:
break
if max(d) - c > result:
result = max(d) - c
print(result)
if __name__ == '__main__':
main()
| def main():
r = []
for _ in range(int(eval(input()))):
r.append(int(eval(input())))
n = len(r)
maxv = -20000000000
minv = r[0]
for i in range(1, n):
maxv = max([maxv, r[i] - minv])
minv = min([minv, r[i]])
print(maxv)
if __name__ == '__main__':
main()
| p02258 |
n = int(eval(input()))
R = [int(eval(input())) for x in range(n)]
maxv = -2000000000
for j in range(1, n):
for i in range(j):
maxv = max(maxv, R[j] - R[i])
print(maxv) | n = int(eval(input()))
r = [int(eval(input())) for x in range(n)]
maxv = -2000000000
minv = r[0]
for i in range(1, n):
maxv = max(maxv, r[i] - minv)
minv = min(minv, r[i])
print(maxv) | p02258 |
n = int( eval(input( )) )
mi = int( eval(input( )) )
profit = 0 - 1000000000
for i in range( n-1 ):
num = int( eval(input( )) )
diff = num - mi
if profit < diff:
profit = diff
if num < mi:
mi = num
print( profit )
| n = int( input( ) )
mi = int( input( ) )
profit = 0 - 1000000000
n -= 1
i = 0
while i < n:
num = int( input( ) )
diff = num - mi
if profit < diff:
profit = diff
if num < mi:
mi = num
i += 1
print( profit ) | p02258 |
N = int(eval(input()))
R = []
for i in range(N):
R.append(int(eval(input())))
mprof = R[1] - R[0]
for i in range(1, len(R)):
for k in range(i):
if mprof < (R[i] - R[k]):
mprof = (R[i] - R[k])
print(mprof) | N = int(eval(input()))
R = []
for i in range(N):
R.append(int(eval(input())))
maxv = R[1] - R[0]
minv = R[0]
for i in range(1, len(R)):
maxv = max(maxv, (R[i] - minv))
minv = min(minv, R[i])
print(maxv) | p02258 |
n = int(eval(input()))
Rt = [eval(input()) for i in range(n)]
benef = int(Rt[1]) - int(Rt[0])
for i in range(n):
for j in range(i+1,n):
rate = int(Rt[j])-int(Rt[i])
if rate > benef:
benef = rate
print(benef) | n = int(eval(input()))
rt = [eval(input()) for i in range(n)]
minv = int(rt[0])
maxv = int(rt[1]) - int(rt[0])
for j in range(1,n):
maxv = max(maxv,int(rt[j]) - minv)
minv = min(minv,int(rt[j]))
print(maxv) | p02258 |
n = int(eval(input()))
r = [None] * n
min = 10**10
max = -10**10
for i in range(n):
r[i] = int(eval(input()))
for i in range(n):
if min > r[i]:
min = r[i]
for j in range(i+1,n):
if max < r[j] - min:
max = r[j] - min
print(max) | n = int(eval(input()))
minv = int(eval(input()))
maxv = (10**9)*(-1)
for j in range(1,n):
r = int(eval(input()))
if maxv < (r - minv):
maxv = r - minv
if minv > r:
minv = r
print(maxv) | p02258 |
import sys
count=int(eval(input()))-1
input_list=[ int(i) for i in sys.stdin.readlines() ]
first=0
second=1
max_price_diff=input_list[second]-input_list[first]
for i in input_list[first:count]:
for j in input_list[second:count+1]:
if j-i > max_price_diff:
max_price_diff=j-i
second=second+1
print(max_price_diff)
| import sys
count=int(eval(input()))
input_list=[ int(i) for i in sys.stdin.readlines() ]
first=0
second=1
maxv=-1000000000
minv=input_list[first]
for i in input_list[second:]:
if i-minv > maxv:
maxv=i-minv
if i < minv:
minv=i
print(maxv)
| p02258 |
import sys
a = []
b = []
for line in sys.stdin:
a.append(int(line))
b.append(int(line))
del a[0]
del a[len(a)-1]
del b[0]
del b[0]
list = []
for i in range(len(a)):
for j in range(len(b)):
if j >= i:
sub = b[j]-a[i]
list.append(sub)
print((max (list)))
| import sys
a = []
b = []
for line in sys.stdin:
a.append(int(line))
b.append(int(line))
del a[0]
del a[len(a)-1]
del b[0]
del b[0]
sub = -10000000000000
for i in range(len(a)):
for j in range(len(b)):
if j >= i:
if sub <= b[j]-a[i]:
sub = b[j]-a[i]
print(sub)
| p02258 |
import sys
a = []
b = []
for line in sys.stdin:
a.append(int(line))
b.append(int(line))
del a[0]
del a[len(a)-1]
del b[0]
del b[0]
sub = -100000000000
for i in range(len(a)):
for i in range(len(a)):
for j in range(len(a)-i):
if sub <= b[i+j]-a[i]:
sub = b[i+j]-a[i]
print(sub)
| import sys
a = []
b = []
for line in sys.stdin:
a.append(int(line))
b.append(int(line))
del a[0]
del a[len(a)-1]
del b[0]
del b[0]
sub = -100000000000
for i in range(len(a)):
for j in range(len(b)):
if j >= i:
if sub <= b[j]-a[i]:
sub = b[j]-a[i]
print(sub)
| p02258 |
import sys
a = []
b = []
for line in sys.stdin:
a.append(int(line))
b.append(int(line))
del a[0]
del a[len(a)-1]
del b[0]
del b[0]
maxlist = []
for i in range(len(a)):
list = []
for j in range(len(b)):
if j >= i:
list.append(b[j]-a[i])
maxlist.append(max(list))
print((max(maxlist)))
| import sys
a = []
b = []
for line in sys.stdin:
a.append(int(line))
b.append(int(line))
del a[0]
del a[len(a)-1]
del b[0]
del b[0]
sub = -1000000000
for i in range(len(a)):
for j in range(len(b)):
if j >= i:
if sub <= b[j]-a[i]:
sub = b[j]-a[i]
print(sub)
| p02258 |
import sys
a = []
b = []
for line in sys.stdin:
a.append(int(line))
b.append(int(line))
del a[0]
del a[len(a)-1]
del b[0]
del b[0]
sub = -1000000000
for i in range(len(a)):
for j in range(len(b)):
if j >= i:
sub = max(sub,b[j]-a[i])
print(sub)
| import sys
a = []
b = []
for line in sys.stdin:
a.append(int(line))
b.append(int(line))
del a[0]
del a[len(a)-1]
del b[0]
del b[0]
maxv = -1000000000
minv = a[0]
for i in range(len(a)):
maxv = max(maxv,b[i]-minv)
minv = min(minv,b[i])
print(maxv)
| p02258 |
mini = pre = float("inf")
def f(n):
global mini, pre
mini = min(mini, pre)
pre = n
return n - mini
print(max(f(eval(input())) for _ in range(eval(input())))) | from itertools import islice
def maximum_profit(rate):
ret = -float("inf")
mi = rate[0]
for r in islice(rate, 1, len(rate)):
ret = max(ret, r - mi)
mi = min(mi, r)
return ret
if __name__ == "__main__":
R = [int(eval(input())) for _ in range(int(eval(input())))]
print((maximum_profit(R))) | p02258 |
n = int(eval(input()))
arr = [0] * n
for i in range(n):
arr[i] = int(eval(input()))
max_profit = arr[1] - arr[0]
min_price = arr[0]
for i in range(1, n):
current = arr[i]
max_profit = max(max_profit, current - min_price)
min_price = min(min_price, current)
print(max_profit)
| n = int(eval(input()))
n0 = int(eval(input()))
n1 = int(eval(input()))
max_profit = n1 - n0
min_price = min(n0, n1)
for i in range(n - 2):
current = int(eval(input()))
max_profit = max(max_profit, current - min_price)
min_price = min(min_price, current)
print(max_profit)
| p02258 |
n = eval(input())
m = [0] * n
max = [0] * n
kijun = [0] * n
rieki = [0] * n
max_rieki = -1*10**9
for i in range(n):
m[i] = eval(input())
for i in range(n):
if i != n-1:
for j in range(i+1,n):
if max_rieki < m[j] - m[i]:
max_rieki = m[j] - m[i]
print(max_rieki) | n = eval(input())
m = [0] * n
max_rieki = -1000000000
for i in range(n):
m[i] = eval(input())
min_rieki = m[0]
for i in range(1,n):
if max_rieki < m[i] - min_rieki:
max_rieki = m[i] - min_rieki
if min_rieki > m[i]:
min_rieki = m[i]
print(max_rieki) | p02258 |
n = int(eval(input()))
L =[]
for i in range(n):
x = int(eval(input()))
L.append(x)
m = L[1]-L[0]
for x in range(n-1):
for i in range(x,n-1):
if m <= L[i+1]-L[x]:
m = L[i+1]-L[x]
else:
pass
print (m) | n = int(eval(input()))
L =[]
for i in range(n):
x = int(eval(input()))
L.append(x)
m = L[1]-L[0]
for x in range(n-1):
for i in range(x,n-1):
m = max([m,L[i+1]-L[x]])
print (m) | p02258 |
import sys
x = []
for line in sys.stdin.readlines():
x.append(int(line.strip()))
length = int(x[0])
del x[0]
max = -(10 ** 9)
for i in range(0, length - 1):
for j in range(i + 1, length):
sa = int(x[j]) - int(x[i])
if max < sa:
max = sa
print(max) | import sys
x = []
for line in sys.stdin.readlines():
x.append(int(line.strip()))
length = int(x[0])
del x[0]
max = -(10 ** 9)
min = x[0]
for i in range(1, length):
sa = x[i] - min
if sa > max:
max = sa
if x[i] < min:
min = x[i]
print(max) | p02258 |
a=eval(input())
r=[]
for i in range(a):
k=eval(input())
r.append(k)
minn=-10**9
for i in range(len(r)):
for j in range(i+1,len(r)):
k=r[j]-r[i]
if k>minn:
minn=k
print(minn) | a=eval(input())
r=[]
for i in range(a):
k=eval(input())
r.append(k)
minv=r[0]
maxv=-10**9
for j in range(1,len(r)):
maxv=max(maxv,r[j]-minv)
minv=min(minv,r[j])
print(maxv) | p02258 |
from _collections import deque
_temp = deque([])
my_max = []
size = int(input().rstrip())
for i in range(size):
try:
_temp.append(int(eval(input())))
except EOFError:
continue
for val in list(_temp)[:-1]:
v = _temp.popleft()
my = max(_temp) - v
if len(my_max) == 0:
my_max.append(my)
else:
if my > max(my_max):
my_max.append(my)
print((max(my_max))) | _temp = []
size = int(input().rstrip())
for i in range(size):
try:
_temp.append(int(eval(input())))
except EOFError:
continue
my_max = -20000000000000
my_min = _temp.pop(0)
for val in _temp:
my_max = max(my_max, (val - my_min))
my_min = min(my_min, val)
print(my_max) | p02258 |
import sys
# ?????§???????±??????????
def get_max(data):
now_max = None
for i in range(0, len(data)-1):
start_val = data[i]
for j in range(i+1, len(data)):
if now_max is None or data[j]-start_val > now_max:
now_max = data[j] - start_val
return now_max
# ??\???????????????????????????
data = []
line_num = int(sys.stdin.readline().rstrip())
while True:
input_data = sys.stdin.readline()
if not input_data:
break
input_data = int(input_data.rstrip())
data.append(input_data)
result = get_max(data)
print(result) | import sys
line_num = int(sys.stdin.readline().rstrip())
maxv = -2000000000
minv = int(sys.stdin.readline().rstrip())
for i in range(1, line_num):
rt = int(sys.stdin.readline())
if rt - minv > maxv:
maxv = rt - minv
if rt < minv:
minv = rt
print(maxv) | p02258 |
num = int(eval(input()))
num_list = [int(eval(input())) for x in range(num)]
max_difference = float("-inf")
for i in range(num):
for j in range(i+1, num):
difference = num_list[j] - num_list[i]
if max_difference < difference:
max_difference = difference
print(max_difference) |
num = int(eval(input()))
max_value = float("-inf")
min_value = float("inf")
for i in [int(eval(input())) for x in range(num)]:
if max_value < (i - min_value):
max_value = i - min_value
if min_value > i:
min_value = i
print(max_value) | p02258 |
n = int(eval(input()))
l = []
for i in range(n):
l.append(int(eval(input())))
result = l[1] - l[0]
for j in range(1, n):
for i in range(0, j):
if l[j] - l[i] > result:
result = l[j] - l[i]
print(result) | n = int(eval(input()))
maxv = -2 * 10 ** 9
minv = 2 * 10 ** 9
for i in range(n):
v = int(eval(input()))
maxv = max(maxv, v - minv)
minv = min(minv, v)
print(maxv) | p02258 |
numberOfInput=int(eval(input()))
numberForStock=[]
index=0
while index<numberOfInput:
inputNumber=int(eval(input()))
numberForStock.append(inputNumber)
index+=1
numberForReturn=-10**9
for indexForMax in range(1,numberOfInput):
for indexForMin in range(0,indexForMax):
if numberForReturn<numberForStock[indexForMax]-numberForStock[indexForMin]:
numberForReturn=numberForStock[indexForMax]-numberForStock[indexForMin]
print(numberForReturn)
| n = int(eval(input()))
index=0
minL=[]
moneyL=[]
while index < n:
inputN = int(eval(input()))
moneyL.append(inputN)
if index==0:
minL.append(inputN)
else:
if minL[index-1] < inputN:
minL.append(minL[index-1])
else:
minL.append(inputN)
index+=1
index2=1
maxProfit = -10**9
while index2 < len(moneyL):
if moneyL[index2] - minL[index2-1] > maxProfit:
maxProfit = moneyL[index2] - minL[index2-1]
else:
pass
index2+=1
print(maxProfit)
| p02258 |
#!/usr/bin/env python3
# input
n = int(eval(input()))
R = []
for i in range(n):
R.append(int(eval(input())))
# calc
maximum = -10**9
for i in range(n):
for j in range(i+1, n):
if R[j] - R[i] > maximum:
maximum = R[j] - R[i]
# output
print(maximum) | #!/usr/bin/env python3
# ?§£??¬??????????????????????????¨????????¨??¬??¬????????§??????
# input & calc
n = int(eval(input()))
max_diff = -20**9
minv = 20**9
for i in range(n):
r = int(eval(input()))
max_diff = max(max_diff, r - minv)
minv = min(minv, r)
# output
print(max_diff) | p02258 |
#!/usr/bin/env python3
# coding: utf-8
# ?§£??¬??????????????????????????¨????????¨??¬??¬????????§??????
# input & calc
n = int(eval(input()))
max_diff = -20**9
minv = 20**9
for i in range(n):
r = int(eval(input()))
max_diff = max(max_diff, r - minv)
minv = min(minv, r)
# output
print(max_diff) | n = int(eval(input()))
max_diff = -10**10
current_min = int(eval(input()))
for _ in range(n-1):
current = int(eval(input()))
diff = current - current_min
if diff > max_diff:
max_diff = diff
if current < current_min:
current_min = current
print(max_diff)
| p02258 |
n = int(eval(input()))
R_max = -10**9
R_min = int(eval(input()))
for i in range(n-1):
R = int(eval(input()))
if R_max < R - R_min:
R_max = R - R_min
if R < R_min:
R_min = R
print(R_max) | n = int(eval(input()))
R = [int(eval(input())) for i in range(n)]
minx = R[0]
maxx = -10**9
for i in range(1, n):
if R[i] - minx > maxx:
maxx = R[i] - minx
if R[i] < minx :
minx = R[i]
print(maxx) | p02258 |
# coding: utf-8
# Here your code !
prof = 0
d = int(eval(input()))
li =[int(eval(input())) for i in range(d)]
max =li[1]-li[0]
while len(li)>1:
for i in range(len(li)):
if li[i]-li[0]>max and i!=0:
max= li[i]-li[0]
li=li[1:]
print(max) | # coding: utf-8
# Here your code !
import math
prof = 0
d = int(eval(input()))
li =[int(eval(input())) for i in range(d)]
max=float("-inf")
min=li[0]
for j in range(1,d):
if li[j]-min>max:
max=li[j]-min
if li[j]<min:
min=li[j]
print(max) | p02258 |
n = int(input())
minv = int(input())
maxv = 0 - 1000000000
for j in range( n-1 ):
num = int( input( ) )
diff = num - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = num
print(maxv) | n = int(input())
minv = int(input())
maxv = -1*10**9
for j in range( n-1 ):
num = int( input( ) )
diff = num - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = num
print(maxv) | p02258 |
s_max = -float('inf')
s = 0
for i in range(int(eval(input()))):
r = int(eval(input()))
if i:
d = r - prev
s = max(s, 0) + d
s_max = max(s, s_max)
prev = r
print(s_max)
| s_max = -float('inf')
s = 0
for i in range(int(eval(input()))):
r = int(eval(input()))
if i:
s = max(s, 0) + r - prev
s_max = max(s, s_max)
prev = r
print(s_max)
| p02258 |
f = lambda: int(eval(input()))
d = -float('inf')
n = f()
l = f()
for _ in range(n-1):
r = f()
d = max(d, r-l)
l = min(l, r)
print(d)
| import sys
d = -float('inf')
n = int(eval(input()))
l = int(eval(input()))
for s in sys.stdin:
r = int(s)
d = max(d, r-l)
l = min(l, r)
print(d)
| p02258 |
N = int(eval(input()))
A = []
for i in range (N):
A.append(eval(input()))
A = list(map(int,A))
Max = A[1]-A[0]
for i in range(N-1):
for j in range(i+1,N):
if (A[j]-A[i]) > Max :
Max = A[j]-A[i]
print(Max)
| n = int(eval(input()))
numbers = []
minv = int(eval(input()))
num = int(eval(input()))
max_r = num - minv
if(minv > num):
minv = num
for i in range(2,n):
num = int(eval(input()))
if(max_r <(num - minv)):
max_r = num - minv
if(minv > num):
minv = num
print(max_r)
| p02258 |
n = int(eval(input()))
R = []
for _ in range(n):
R.append(int(eval(input())))
maxv = R[1] - R[0]
for i in range(1, n):
for j in range(0, i):
maxv = max(R[i] - R[j], maxv)
print(maxv) | n = int(eval(input()))
R = []
for _ in range(n):
R.append(int(eval(input())))
maxv = R[1] - R[0]
minv = R[0]
for j in range(1, n):
maxv = max(R[j] - minv, maxv)
minv = min(R[j],minv)
print(maxv) | p02258 |
n=int(eval(input()))
z=[]
for i in range(n):
z+=[int(eval(input()))]
a=0
zz=[]
zzz=[]
while True:
if a==len(z):
break
j=a+1
for i in z[j:]:
zz+=[i-z[a]]
zzz+=[max(zz)]
a+=1
print((max(zzz))) | n=int(eval(input()))
r_min=int(eval(input()))
r_t=int(eval(input()))
g_max=r_t-r_min
r_min=min(r_t,r_min)
for _ in range(n-2):
r_t=int(eval(input()))
g_max=max(g_max,r_t-r_min)
r_min=min(r_t,r_min)
print(g_max)
| p02258 |
import functools
n = int(eval(input()))
R = [int(eval(input())) for i in range(n)]
benefit = [[rj - ri for j,rj in enumerate(R[i:]) if j+i > i] for i,ri in enumerate(R)]
print((max(functools.reduce(lambda a,b: a+b, benefit)))) | n = int(eval(input()))
R = [int(eval(input())) for i in range(n)]
minv = float('inf')
maxv = -float('inf')
for r in R:
maxv = max(maxv, r-minv)
minv = min(minv, r)
print(maxv) | p02258 |
R = [(int(eval(input())), i) for i in range(int(eval(input())))]
print((max([max(y-x for y, j in R[i+1:]) for x, i in R[:-1]]))) | R = [int(eval(input())) for i in range(int(eval(input())))]
maxp = R[1] - R[0]
minv = R[0]
for r in R[1:]:
maxp = max(maxp, r-minv)
minv = min(minv, r)
print(maxp) | p02258 |
res = -10 ** 9
n = int(eval(input()))
a = int(eval(input()))
Min = int(a)
for mak in range(n - 1) :
tem = 0
b = int(eval(input()))
Min = min(b, Min)
if b < a : tem = b - a
else : tem = b - Min
if tem > res : res = int(tem)
a = int(b)
print(res) | res = -10 ** 9
n = int(eval(input()))
a = int(eval(input()))
Min = int(a)
for mak in range(n - 1) :
tem = 0
b = int(eval(input()))
if b < Min : Min = int(b)
if b < a : tem = b - a
else : tem = b - Min
if tem > res : res = int(tem)
a = int(b)
print(res) | p02258 |
N = int(eval(input()))
list = []
for i in range(N):
tmp = int(eval(input()))
list.append(tmp)
maxDiff = - 10 ** 9
for i in range(N):
for j in range(i+1, N):
tmpDiff = list[j] - list[i]
if tmpDiff > maxDiff:
maxDiff = tmpDiff
print(maxDiff)
| N = int(eval(input()))
list = []
for i in range(N):
tmp = int(eval(input()))
list.append(tmp)
maxDiff = - 10 ** 9
tmpMin = list[0]
for i in range(N-1):
maxDiff = max([maxDiff, list[i+1] - tmpMin])
tmpMin = min([tmpMin, list[i+1]])
print(maxDiff)
| p02258 |
N = int(eval(input()))
R = [int(eval(input())) for i in range(N)]
sa = R[N - 1] - R[N - 2]
for i in reversed(list(range(N))):
for j in reversed(list(range(i))):
tmp = R[i] - R[j]
if tmp > sa:
sa = tmp
print(sa)
| N = int(eval(input()))
R = [int(eval(input())) for i in range(N)]
min_v = R[0]
max_v = R[1] - R[0]
for i in range(1, len(R)):
if min_v > R[i - 1]:
min_v = R[i - 1]
if max_v < R[i] - min_v:
max_v = R[i] - min_v
print(max_v)
| p02258 |
#Reference : http://qiita.com/lethe2211/items/6cbade2bc547649bc040
n = eval(input())
R = []
for i in range(n):
R.append(eval(input()))
start_point = 0
peak = 0
max_diff = -pow(10, 9)
while (start_point < n - 1):
diff = -pow(10, 9)
for i in range(start_point + 1, n):
diff_temp = R[i] - R[start_point]
if (diff_temp >= diff):
diff = diff_temp
peak = i
for i in range(start_point, peak):
diff_temp = R[peak] - R[i]
if (diff_temp > max_diff):
max_diff = diff_temp
start_point = peak
print(max_diff) | #Reference : http://qiita.com/lethe2211/items/6cbade2bc547649bc040
#Reference : http://judge.u-aizu.ac.jp/onlinejudge/commentary.jsp?id=ALDS1_1_D
n = eval(input())
R = []
for i in range(n):
R.append(eval(input()))
min_v = R[0]
max_v = -pow(10, 9)
for i in range(1, n):
temp = R[i] - min_v
if (temp >= max_v):
max_v = temp
temp = R[i]
if (min_v >= temp):
min_v = temp
print(max_v)
| p02258 |
import sys
x = []
max = -(10**9)
for line in sys.stdin.readlines():
x.append(line.strip())
length = int(x[0])
x.remove(x[0])
for i in range(0, length):
for j in range(i + 1, length):
sa = int(x[j]) - int(x[i])
if max < sa:
max = sa
print(max) | import sys
x = []
for line in sys.stdin.readlines():
x.append(line.strip())
max = -(10**9)
min = int(x[1])
for i in range(2, int(x[0])+1):
sa = int(x[i]) - min
if max < sa:
max = sa
if min > int(x[i]):
min = int(x[i])
print(max) | p02258 |
n = int(eval(input()))
R = []
for i in range(0,n):
R.insert(i,int(eval(input())))
MAX = R[1] - R[0]
for r in range(2,n):
o = R[r] - min(R[:r])
if(MAX < o):
MAX = o
print(MAX) | n = int(eval(input()))
R = []
for i in range(0,n):
R.insert(i, int(eval(input())))
m = min(R[0:2])
MAX = R[1] - R[0]
for r in range(2, n):
if(R[r-1] < m):
m = R[r-1]
MAX2 = R[r] - m
if(MAX2 > MAX):
MAX = MAX2
print(MAX) | p02258 |
n = int(eval(input()))
x = []
for i in range(n):
x.append(int(eval(input())))
m = float("inf") * (-1)
for i in range(n-1):
for j in range(i+1,n):
if m < (x[j] - x[i]):
m = x[j] - x[i]
print(m)
| n = int(eval(input()))
x = []
for i in range(n):
x.append(int(eval(input())))
mx = float("inf") * (-1)
mn = x[0]
for i in range(1,n):
if mx < (x[i] - mn):
mx = x[i] - mn
if mn > x[i]:
mn = x[i]
print(mx)
| p02258 |
n = int(eval(input()))
ns = []
max_profit = -1000000000
min_value = 1000000000
for i in range(n):
num = int(eval(input()))
if i > 0:
max_profit = max(max_profit, num-min_value)
min_value = min(num, min_value)
print(max_profit)
| n = int(eval(input()))
ns = []
max_profit = -1000000000
min_value = int(eval(input()))
for i in range(1,n):
num = int(eval(input()))
max_profit = max(max_profit, num-min_value)
min_value = min(num, min_value)
print(max_profit)
| p02258 |
n = int(input().rstrip())
R = [0 for _ in range(n)]
for i in range(n):
R[i] = int(input().rstrip())
max_margin = 1 - 10**9
for i in range(n):
for j in range(i+1, n):
margin = R[j] - R[i]
if margin > max_margin:
max_margin = margin
print(max_margin)
| n = int(input().rstrip())
R = [0 for _ in range(n)]
for i in range(n):
R[i] = int(input().rstrip())
margin = - 10**9
min_R = R[0]
for j in range(1, n):
margin = max(margin, R[j] - min_R)
min_R = min(min_R, R[j])
print(margin)
| p02258 |
# -*- coding : utf-8 -*-
def maximum_profit(price_list):
max = price_list[1] - price_list[0]
for x in range(len(price_list)-1):
for y in range(x+1, len(price_list)):
if max < price_list[y] - price_list[x]:
max = price_list[y] - price_list[x]
return max
input_num = int(eval(input()))
price_list = list()
for i in range(input_num):
input_price = int(eval(input()))
price_list.append(input_price)
print((maximum_profit(price_list))) | # -*- coding : utf-8 -*-
def maximum_profit(price_list):
max = price_list[1] - price_list[0]
min = price_list[0]
for i in range(1, len(price_list)):
if max < price_list[i] - min:
max = price_list[i] - min
if min > price_list[i]:
min = price_list[i]
return max
input_num = int(eval(input()))
price_list = list()
for i in range(input_num):
input_price = int(eval(input()))
price_list.append(input_price)
print((maximum_profit(price_list))) | p02258 |
n = int(eval(input()))
DifMax = -999999999
R = [int(eval(input()))]
for i in range(1, n):
RMin = min(R)
R.append(int(eval(input())))
if DifMax < R[i] - RMin:
DifMax = R[i] - RMin
print(DifMax) | n = int(eval(input()))
DifMax = -9999999999999
R = [int(eval(input()))]
RMin = R[0]
for i in range(1, n):
if RMin > R[i-1]:
RMin = R[i-1]
R.append(int(eval(input())))
if DifMax < R[i] - RMin:
DifMax = R[i] - RMin
print(DifMax) | p02258 |
n = int(eval(input()))
R = []
for i in range(n):
R.append(int(eval(input())))
kouho = set()
diff_max = None
for (i, rt) in enumerate(R):
if i == 0:
rt_min = rt
else:
if rt < rt_min and not (diff_max is None):
kouho.add(diff_max)
diff_max = None
rt_min = rt
elif rt < rt_min and diff_max is None:
rt_min = rt
elif rt >= rt_min:
if diff_max is None:
diff_max = rt - rt_min
else:
diff_max = max(diff_max, rt - rt_min)
if not (diff_max is None):
kouho.add(diff_max)
# print(kouho)
if kouho != set():
print((max(kouho)))
else:
diff_tonari = {R[i + 1] - R[i] for i in range(n - 1)}
print((max(diff_tonari))) |
n = int(eval(input()))
R = []
for i in range(n):
R.append(int(eval(input())))
minv = R[0]
maxv = R[1] - R[0]
for r in R[1:]:
maxv = max(maxv, r - minv)
minv = min(minv, r)
print(maxv) | p02258 |
n = int(eval(input()))
dif_max = -float("inf")
min_v = float("inf")
for i in range(n):
r = int(eval(input()))
dif_max = max(dif_max, r - min_v)
min_v = min(min_v, r)
print(dif_max) | import sys
n = int(eval(input()))
dif_max = -float("inf")
min_v = float("inf")
for i in range(n):
r = int(sys.stdin.readline())
dif_max = max(dif_max, r - min_v)
min_v = min(min_v, r)
print(dif_max) | p02258 |
from sys import stdin
inf = 10**9 + 1
def solve():
n = int(stdin.readline())
R = [int(stdin.readline()) for i in range(n)]
ans = max_profit2(n, R)
print(ans)
def max_profit(n, R):
max_d = -inf
min_v = R[0]
for i in range(1, n):
max_d = max(max_d, R[i] - min_v)
min_v = min(min_v, R[i])
return max_d
def max_profit2(n, R):
max_dif = -inf
for left in range(n):
for j in range(left + 1, n):
max_dif = max(max_dif, R[j] - R[left])
return max_dif
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
if __name__ == '__main__':
solve()
| from sys import stdin
inf = 10**9 + 1
def solve():
n = int(stdin.readline())
max_d = -inf
min_v = inf * 2
for i in range(n):
r = int(stdin.readline())
max_d = max(max_d, r - min_v)
min_v = min(min_v, r)
print(max_d)
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
if __name__ == '__main__':
solve()
| p02258 |
def calcMax(i):
now = numbers[i]
future_max = max(numbers[i+1:])
#print(numbers[i+1:])
t = numbers[i+1:]
#print((max(t)))
return future_max - now
n = int(eval(input()))
numbers = []
for i in range(n):
numbers.append(int(eval(input())))
m = -1000000001
for i in range(len(numbers) - 1):
if i == 0 or i == len(numbers) - 1 or (numbers[i-1] >= numbers[i] and numbers[i] < numbers[i+1]) or (numbers[i-1] > numbers[i] and numbers[i] <= numbers[i+1]):
temp = calcMax(i)
#print("temp: " + str(temp))
if temp > m:
m = temp
print (m)
| def calcMax(i):
now = numbers[i]
future_max = max(numbers[i+1:])
#print(numbers[i+1:])
t = numbers[i+1:]
#print((max(t)))
return future_max - now
n = int(eval(input()))
numbers = []
for i in range(n):
numbers.append(int(eval(input())))
m = -1000000001
ti = 1000000001
for i in range(len(numbers) - 1):
if numbers[i] < ti:
if (i == 0 or i == len(numbers) - 1 or (numbers[i-1] >= numbers[i] and numbers[i] <= numbers[i+1])):
temp = calcMax(i)
#print("temp: " + str(temp))
if temp > m:
m = temp
ti = numbers[i]
print (m)
| p02258 |
n = int(eval(input()))
values = []
for i in range(n):
value = int(eval(input()))
values.append(value)
def profit(values):
sorted_values = sorted(values)
minimum = sorted_values[0]
maximum = sorted_values[-1]
diff_list = []
while values != []:
diff = minimum - maximum
start = values[0]
for v in values[1:]:
tmp_diff = v - start
if tmp_diff > diff:
diff = tmp_diff
diff_list.append(diff)
values.remove(values[0])
diff_list.sort(reverse = True)
return diff_list[0]
print((profit(values))) | n = int(eval(input()))
values = [int(eval(input())) for i in range(n)]
maxv = -999999999
minimum = values[0]
for i in range(1, n):
if values[i] - minimum > maxv:
maxv = values[i] - minimum
if values[i] < minimum:
minimum = values[i]
print(maxv) | p02258 |
# -*- coding: utf-8 -*-
def maximum_profit(profits):
max_v = profits[1] - profits[0]
for j in range(1, len(profits)):
for i in range(0, j):
max_v = max(profits[j] - profits[i], max_v)
print(max_v)
def to_int(v):
return int(v)
if __name__ == '__main__':
l = to_int(eval(input()))
profits = [to_int(eval(input())) for i in range(l)]
maximum_profit(profits) | # -*- coding: utf-8 -*-
def maximum_profit(profits):
max_v = profits[1] - profits[0]
min_v = profits[0]
for j in range(1, len(profits)):
max_v = max(max_v, profits[j]-min_v)
min_v = min(min_v, profits[j])
print(max_v)
def to_int(v):
return int(v)
if __name__ == '__main__':
l = to_int(eval(input()))
profits = [to_int(eval(input())) for i in range(l)]
maximum_profit(profits) | p02258 |
n = int(input())
num_list = [int(input()) for i in range(n)]
#print num_list
ans = max(num_list[1:]) - num_list[0]
chk = num_list[0]
# print "ans=%d, chk=%d" % (ans, chk)
for i in range(1, n - 1):
if num_list[i] >= chk:
continue
max_num = max(num_list[i+1:])
# print max_num
tmp = max_num - num_list[i]
if tmp > ans:
ans = tmp
# print "i = %d, tmp = %d, ans = %d" % (i, tmp, ans)
print(ans) | n = int(input())
num_list = [int(input()) for i in range(n)]
minv = num_list[0]
maxv = -1000000000
for i in range(1, n):
tmp = num_list[i] - minv
maxv = tmp if tmp > maxv else maxv
minv = num_list[i] if minv > num_list[i] else minv
# print "i = %d, tmp = %d, maxv = %d, minv = %d" % (i, tmp, maxv, minv)
print(maxv) | p02258 |
n = int(eval(input()))
r = [int(eval(input())) for x in range(n)]
cur_max_diff = min(r) - max(r)
cur_min_idx = -1
for i in range(n) :
if i == 0 :
for j in range(1, n) :
if r[j] - r[i] > cur_max_diff :
cur_max_diff = r[j] - r[i]
cur_min_idx = j
elif i >= cur_min_idx :
for j in range(i + 1, n) :
if r[j] - r[i] > cur_max_diff :
cur_max_diff = r[j] - r[i]
cur_min_idx = j
else :
cur_max_diff = max(cur_max_diff, r[cur_min_idx] - r[i])
print(cur_max_diff)
| n = int(eval(input()))
# initial observation
cur_min = int(eval(input()))
max_diff = -1 * (10**9) - 1
for i in range(n - 1) :
num = int(eval(input()))
max_diff = max(max_diff, num - cur_min)
if num < cur_min :
cur_min = num
print(max_diff)
| p02258 |
#coding:utf-8
#1_1_D
n = int(eval(input()))
maxv = -2 * 10 ** 9
prices = [int(eval(input())) for x in range(n)]
for i in range(1, n):
for j in range(i):
if prices[i] - prices[j] > maxv:
maxv = prices[i] - prices[j]
print(maxv) | #coding:utf-8
#1_1_D
n = int(eval(input()))
prices = [int(eval(input())) for x in range(n)]
maxv = -2 * 10 ** 9
minv = prices[0]
for i in range(1, n):
maxv = max(maxv, prices[i] - minv)
minv = min(minv, prices[i])
print(maxv) | p02258 |
#-*- coding:utf-8 -*-
def main():
n , data = input_data()
vMax = float('-inf')
i = 1
for i, Ri in enumerate(data):
for Rj in data[i+1:]:
n = Rj - Ri
if vMax < n:
vMax = n
print(vMax)
def input_data():
n = int(eval(input()))
lst = [int(eval(input())) for i in range(n)]
return (n , lst)
if __name__ == '__main__':
main() | #-*- coding:utf-8 -*-
def main():
n , data = input_data()
vMax = float('-inf')
i = 1
minIndex = min(enumerate(data) , key = lambda x:x[1])[0]
for i, Ri in enumerate(data):
if data[i+1:]:
n = max(data[i+1:]) - Ri
if vMax < n:
vMax = n
if i == minIndex: # Ri???????°???????????????¨????????????????¨??????????
break
print(vMax)
def input_data():
n = int(eval(input()))
lst = [int(eval(input())) for i in range(n)]
return (n , lst)
if __name__ == '__main__':
main() | p02258 |
#-*- coding:utf-8 -*-
def main():
n , data = input_data()
vMax = float('-inf')
i = 1
minIndex = min(enumerate(data) , key = lambda x:x[1])[0]
maxIndex = max(enumerate(data) , key = lambda x:x[1])[0]
for i, Ri in enumerate(data):
if data[i+1:]:
if maxIndex < i + 1:
maxIndex, Rj= max(enumerate(data[i+1:]) , key = lambda x:x[1])
maxIndex += i + 1
else:
Rj = data[maxIndex]
n = Rj - Ri
if vMax < n:
vMax = n
if i == minIndex: # Ri???????°???????????????¨????????????????¨??????????
break
print(vMax)
def input_data():
n = int(eval(input()))
lst = [int(eval(input())) for i in range(n)]
return (n , lst)
if __name__ == '__main__':
main() | #-*- coding:utf-8 -*-
def main():
n , data = input_data()
vMax = float('-inf')
vMin = data.pop(0)
for Rj in data:
if vMax < Rj - vMin:
vMax = Rj - vMin
if vMin > Rj:
vMin = Rj
print(vMax)
def input_data():
n = int(eval(input()))
lst = [int(eval(input())) for i in range(n)]
return (n , lst)
if __name__ == '__main__':
main() | p02258 |
N=int(eval(input()))
A=[int(eval(input())) for _ in range(N)]
mp=A[1]-A[0]
mn=A[0]
for i in range(1,N):
if mp < (A[i]-mn):
mp=A[i]-mn
if 0>A[i]-mn:
mn = A[i]
if A[i]<mn:
mn=A[i]
print(mp) | N=int(eval(input()))
A=[int(eval(input())) for _ in range(N)]
mp=A[1]-A[0]
mn=A[0]
for i in range(1,N):
x=A[i]
if mp < (x-mn):
mp=x-mn
if 0>x-mn:
mn = x
if x<mn:
mn=x
print(mp) | p02258 |
i=input
r=range
N=int(i())
A=[int(i()) for _ in r(N)]
mp=A[1]-A[0]
mn=A[0]
for a in r(1,N):
x=A[a]
b=x-mn
if mp<(b):
mp=b
if 0>b:mn=x
if x<mn:mn=x
print(mp) | import sys
i=input
n = int(i())
r0 = int(i())
r1 = int(i())
mx = r1-r0
mn = min(r1,r0)
for i in map(int,sys.stdin.readlines()):
a=i-mn
if mx<a:
mx=a
if 0>a:mn=i
elif mn>i:mn=i
print(mx) | p02258 |
n = int(eval(input()))
num = [0 for i in range(n)]
for i in range(n):
num[i] = int(eval(input()))
m = -float('inf')
res = m
for i in range(n):
for j in range(i+1,n):
if m < num[j] - num[i]:
m = num[j] - num[i]
res = max(m,res)
print(res) | import sys
eval(input())
mx = -float('inf')
res = mx
mn = int(eval(input()))
for i in map(int,sys.stdin.readlines()):
if mx < i - mn:
mx = i - mn
if 0 > i - mn:
mn = i
res = max(mx,res)
print(res) | p02258 |
n = eval(input())
R = []
for i in range(n):
R.append(eval(input()))
profit = R[1] - R[0]
for i in range(n):
for j in range(i+1, n):
if R[j] - R[i] > profit:
profit = R[j] - R[i]
print("%d" % profit) | n = eval(input())
R = []
for i in range(n):
R.append(eval(input()))
profit = R[n-1] - R[0]
after = R[n-1]
for i in range(n):
if R[n-1-i] < after and i != 0:
continue
for j in range(n-i-1):
if R[n-1-i] - R[j] > profit:
profit = R[n-1-i] - R[j]
after = R[n-1-i]
print("%d" % profit) | p02258 |
N = int(input())
nums = []
for i in range(N):
nums.append(int(input()))
m = -1000000000000000000000000
for i in range(1, len(nums)):
value = nums[i] - min(nums[:i])
if m <= value:
m = value
print(m) | N = int(input())
nums = []
for i in range(N):
nums.append(int(input()))
m = -1000000000000000000000000
minvalue = nums[0]
for i in range(1, len(nums)):
minvalue = min(minvalue, nums[i-1])
value = nums[i] - minvalue
if m <= value:
m = value
print(m) | p02258 |
n = int(eval(input()))
x = []
for i in range(n):
x.append(int(eval(input())))
imin=0
imax=1
maxVal=x[imax]-x[imin]
for i in range(1,n):
if x[imin] > x[i]:
imin=i
imax=i+1
if imax > n-1:
break
dx = x[imax]-x[imin]
if maxVal < dx:
maxVal = dx
elif x[imax] < x[i]:
imax = i
dx = x[imax]-x[imin]
if maxVal < dx:
maxVal = dx
print(maxVal)
| n = int(eval(input()))
maxVal = -2000000000
minVal = int(eval(input()))
for i in range(1,n):
x=int(eval(input()))
dx = x-minVal
if maxVal < dx:
maxVal = dx
if minVal > x:
minVal = x
print(maxVal)
| p02258 |
N,M=list(map(int,input().split()))
if M >= 2*N:
print(((N+M//2)//2))
else:
print((M//2)) | s,c=list(map(int,input().split()))
if 2*s<=c: print(((s+c//2)//2))
else: print((c//2)) | p03797 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.