s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s968538336 | p02258 | u682357930 | 1452612143 | Python | Python | py | Runtime Error | 0 | 0 | 156 | import math
n = input()
maxv = -1 * 10**9
minv = input()
for j in range(1:n-1):
v = input()
maxv = max(maxv, v-minv)
minv = min(v, minv)
print maxv |
s090504986 | p02258 | u682357930 | 1452612167 | Python | Python | py | Runtime Error | 0 | 0 | 170 | import math
n = input()
maxv = -1 * 10**9
minv = input()
for j in range(1:n-1):
v = input()
maxv = max(maxv, v-minv)
minv = min(v, minv)
print '{0}'.format(maxv) |
s852742279 | p02258 | u682357930 | 1452612186 | Python | Python | py | Runtime Error | 0 | 0 | 170 | import math
n = input()
maxv = -1 * 10**9
minv = input()
for i in range(1:n-1):
v = input()
maxv = max(maxv, v-minv)
minv = min(v, minv)
print '{0}'.format(maxv) |
s027358227 | p02258 | u682357930 | 1452612527 | Python | Python | py | Runtime Error | 0 | 0 | 161 | n = input()
maxv = -1 * 10**9
minv = input()
for j in range(n-1):
v = input()
if maxv < v - minv:
maxv = v - minv
if minv > v
minv = v
print maxv |
s215077670 | p02258 | u682357930 | 1452612542 | Python | Python | py | Runtime Error | 0 | 0 | 163 | n = input()
maxv = -1 * 10**9
minv = input()
for j in range(1,n-1):
v = input()
if maxv < v - minv:
maxv = v - minv
if minv > v
minv = v
print maxv |
s534272299 | p02258 | u682357930 | 1452612607 | Python | Python | py | Runtime Error | 0 | 0 | 163 | n = input()
maxv = -1 * 10**9
minv = input()
for j in range(1,n-1):
v = input()
if maxv < v - minv:
maxv = v - minv
if minv > v
minv = v
print maxv |
s718966068 | p02258 | u424209323 | 1453173548 | Python | Python | py | Runtime Error | 0 | 0 | 208 | num = raw_input()
max = 1 - 1000000000
length = len(num)
for i in range (length):
for j in range (i + 1, n):
if (max > (num[i] - num[j])):
max = num[i] - num[j]
print max |
s972066322 | p02258 | u341533698 | 1454330158 | Python | Python | py | Runtime Error | 0 | 0 | 230 | def main():
N = input()
a = [input() for y in range(N)]
a_max = -10**9
for i in xrange(1,len(a)):
if (max(a[(i+1):]) - a[i]) >= a_max:
a_max = max(a[(i+1):]) - a[i]
return a_max
main() |
s905082836 | p02258 | u341533698 | 1454330575 | Python | Python | py | Runtime Error | 0 | 0 | 206 | N = input()
a = [input() for y in range(N)]
a_max = -10**9
for i in xrange(1,len(a)-1):
if (max(a[(i+1):]) - a[i]) >= a_max:
a_max = max(a[(i+1):]) - a[i]
print a_max |
s231911076 | p02258 | u923973323 | 1456500672 | Python | Python3 | py | Runtime Error | 0 | 0 | 212 | raw_data = raw_input()
data = raw_data.split('\n')
n = data.pop(0)
max_v = 1000000000
min_v = -1000000000
for i, r in enumerate(data):
max_v = max(max_v, r - min_v)
min_v = min(min_v, r)
print(max_v) |
s947345058 | p02258 | u923973323 | 1456500924 | Python | Python3 | py | Runtime Error | 0 | 0 | 219 | max_v = 1000000000
min_v = -1000000000
with open('in1.txt', 'r') as f:
raw_data = f.readline()
n = raw_data
for r in f:
max_v = max(max_v, r - min_v)
min_v = min(min_v, r)
print(max_v) |
s688281352 | p02258 | u923973323 | 1456501287 | Python | Python3 | py | Runtime Error | 0 | 0 | 246 | max_v = 1000000000
min_v = -1000000000
n = input()
data = []
for i in range(N):
data.append(input())
for r in data:
max_v = max(max_v, r - min_v)
min_v = min(min_v, r)
print(max_v) |
s935175991 | p02258 | u923973323 | 1456501354 | Python | Python3 | py | Runtime Error | 0 | 0 | 246 | max_v = 1000000000
min_v = -1000000000
N = input()
data = []
for i in range(N):
data.append(input())
for r in data:
max_v = max(max_v, r - min_v)
min_v = min(min_v, r)
print(max_v) |
s498574545 | p02258 | u923973323 | 1456501427 | Python | Python3 | py | Runtime Error | 0 | 0 | 242 | max_v = 1000000000
min_v = -1000000000
N = input()
data = []
for i in range(N):
data.append(input())
for r in data:
max_v = max(max_v, r - min_v)
min_v = min(min_v, r)
print(N) |
s110303711 | p02258 | u923973323 | 1456501671 | Python | Python3 | py | Runtime Error | 0 | 0 | 242 | max_v = 1000000000
min_v = -1000000000
N = input()
data = []
for i in range(N):
data.append(input())
for r in data:
max_v = max(max_v, r - min_v)
min_v = min(min_v, r)
print(3) |
s129252196 | p02258 | u994049982 | 1458666041 | Python | Python | py | Runtime Error | 0 | 0 | 158 | a=input()
b=[]
for i in range(0,a+1):
b.append()
c=-400001
for i in range(a):
for ii in range(i,a):
if b[ii]-b[i]>c:c=b[ii]-b[i]
print(str(c)) |
s899083614 | p02258 | u994049982 | 1458666083 | Python | Python | py | Runtime Error | 0 | 0 | 173 | a=int(input())
b=[]
for i in range(a+1):
b.append(int(input()))
c=-400001
for i in range(a):
for ii in range(i,a):
if b[ii]-b[i]>c:c=b[ii]-b[i]
print(str(c)) |
s045028533 | p02258 | u572790226 | 1459915849 | Python | Python3 | py | Runtime Error | 40 | 7820 | 188 | import math
A = []
N = int(input())
maxdiff = 0
for n in range(N):
A.append(int(input()))
S = tuple(A)
Smax = ((S[i]-min(S[:i])) for i in range(1, N) if S[i] > S[i-1])
print(max(Smax)) |
s449302323 | p02258 | u003309334 | 1464669916 | Python | Python | py | Runtime Error | 10 | 6432 | 389 | n = input()
R = [input() for i in xrange(n)]
Rmin = n
maxdif = R[1] - R[0]
while Rmin > 0:
tRmin = R.index(min(R[0:Rmin]))
Rmax = R.index(max(R[tRmin:Rmin]))
if tRmin == Rmax:
if tRmin == n:
tRmin-=1
elif tRmin < n:
Rmax = tRmin + 1
Rmin = tRmin
if (R[Rmax] - R[Rmin]) > maxdif:
maxdif = R[Rmax] - R[Rmin]
print maxdif |
s919576632 | p02258 | u930806831 | 1464939105 | Python | Python3 | py | Runtime Error | 0 | 0 | 258 | n = int(input())
values = [int(input()) for i in range(n)]
maxv = -99999999
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) |
s548426181 | p02258 | u935184340 | 1467284555 | Python | Python3 | py | Runtime Error | 0 | 0 | 280 | import sys
n = int(input())
r0 = int(input())
r1 = int(input())
mx = r1-r0
mn = min(r1,r0)
for i in map(int,sys.stdin.readlines()):
if 0 < mx < i - mn:
mx = i - mn
elif 0 > i-mn > max:
mx = i - mn
mn = i
elif mn > i:
mn = i
print(mx) |
s768119859 | p02258 | u231136358 | 1471793745 | Python | Python3 | py | Runtime Error | 0 | 0 | 256 | r = []
N = int(input())
for i in range(0, N):
r.append(int(input()))
min_i = N-2
max_i = N-1
for i in range(N-1)[::-1]:
for j in range(i+1, N):
if r[j] - r[i] > r[max_i] - r[min_i]:
max_i = j
min_i = i
print(tmp) |
s087811785 | p02258 | u443119229 | 1472187007 | Python | Python3 | py | Runtime Error | 0 | 0 | 183 | N = input()
a = []
for i in range(N):
a.append(input())
max_profit = a[1] - a[0]
for i in range(2,N):
if a[i] - a[i-1] > max_profit
max_profit = a[i] - a[i-1]
print(max_profit) |
s437647934 | p02258 | u443119229 | 1472187037 | Python | Python3 | py | Runtime Error | 0 | 0 | 188 | N = input()
a = []
for i in range(N):
a.append(input())
max_profit = a[1] - a[0]
for i in range(2,N):
if a[i] - a[i-1] > max_profit
max_profit = a[i] - a[i-1]
print(str(max_profit)) |
s560931229 | p02258 | u443119229 | 1472187253 | Python | Python3 | py | Runtime Error | 0 | 0 | 198 | N = int(input())
a = []
for i in range(N):
a.append(int(input())
max_profit = a[1] - a[0]
for i in range(2,N):
if a[i] - a[i-1] > max_profit:
max_profit = a[i] - a[i-1]
print(str(max_profit)) |
s371058493 | p02258 | u443119229 | 1472188829 | Python | Python3 | py | Runtime Error | 0 | 0 | 268 | N = int(input())
a = []
for i in range(N):
a.append(int(input()))
max_profit = a[1] - a[0]
min_val = min(a[1],a[0])
for i in range(2,N):
if a[i] < min_val:
min_val = a[i]
else if a[i] - min_val > max_profit:
max_profit = a[i] - min_val
print(str(max_profit)) |
s238824502 | p02258 | u390995924 | 1472565588 | Python | Python3 | py | Runtime Error | 0 | 0 | 166 | n = int(input())
ps = [int(input()) for _ in range(n)]
maxpro = 0
for i, p in enumerate(ps[:-1]):
pro = max(ps[i + 1:]) - p
maxpro = max(pro, maxpro)
print maxpro |
s504148935 | p02258 | u756595712 | 1474703144 | Python | Python3 | py | Runtime Error | 0 | 0 | 352 | _temp = []
with open('_input_alds1', 'r') as f:
for line in f.readlines():
_temp.append(int(line.rstrip()))
_temp = _temp[1:]
my_max = []
for i, val in enumerate(_temp[:-1]):
my = max(_temp[i + 1:]) - val
if i == 0:
my_max.append(my)
else:
if my > max(my_max):
my_max.append(my)
print(max(my_max)) |
s637099208 | p02258 | u756595712 | 1474704068 | Python | Python3 | py | Runtime Error | 0 | 0 | 392 | from _collections import deque
_temp = deque([])
my_max = []
size = int(input().rstrip())
for i in range(size):
try:
_temp.append(int(input()))
except EOFError:
continue
for val in _temp:
v = _temp.popleft()
my = max(_temp) - v
if i == 0:
my_max.append(my)
else:
if my > max(my_max):
my_max.append(my)
print(max(my_max)) |
s884147321 | p02258 | u756595712 | 1474704456 | Python | Python | py | Runtime Error | 0 | 0 | 415 | from _collections import deque
_temp = deque([])
my_max = []
size = int(input().rstrip())
for i in range(size):
try:
_temp.append(int(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)) |
s142295726 | p02258 | u831244171 | 1477802275 | Python | Python | py | Runtime Error | 0 | 0 | 222 | n = input()
m = []
for i in range(n):
m.append(input())
interest = [m[1]-m[0]]
for i in range(n):
for j in range(i+1,n):
if interest[-1] < m[j]-m[i]
interest.append(m[j]-m[i])
print(interest[-1])
|
s095676334 | p02258 | u831244171 | 1477802317 | Python | Python | py | Runtime Error | 0 | 0 | 223 | n = input()
m = []
for i in range(n):
m.append(input())
interest = [m[1]-m[0]]
for i in range(n):
for j in range(i+1,n):
if interest[-1] < m[j]-m[i]:
interest.append(m[j]-m[i])
print(interest[-1])
|
s775912975 | p02258 | u831244171 | 1477802495 | Python | Python | py | Runtime Error | 0 | 0 | 206 | n = input()
m = []
for i in range(n):
m.append(input())
interest = [m[1]-m[0]]
for i in range(n):
M = max(m[i+1:])
if interest[-1] <M-m[i]:
interest.append(M-m[i])
print(interest[-1])
|
s862432538 | p02258 | u497195381 | 1480231198 | Python | Python | py | Runtime Error | 0 | 0 | 164 | import sys
a = []
for line in sys.stdin:
a.append(int(line))
max=a[0]
min=a[1]
for b in a
if a[b] <= min:
min=a[b]
if a[b] >= max:
max=a[b]
print(max-min) |
s843909420 | p02258 | u497195381 | 1480231627 | Python | Python | py | Runtime Error | 0 | 0 | 178 | import sys
a = []
for line in sys.stdin:
a.append(int(line))
min=a[0]
max=-1*10**9
for b in a:
if a[b+1]-min >= max:
max=a[b]-min
if a[b+1] <= min:
min=a[b]
print(max) |
s483084994 | p02258 | u119456964 | 1480347796 | Python | Python | py | Runtime Error | 0 | 0 | 428 | n = int(raw_input())
R = [0 for i in range(n)]
ans = 1 - 10**9
for i in range(n):
R[i] = int(raw_input())
if i == 0:
min_R = R[0]
continue
if min_R < R[i]:
if ans < R[i]-min_R:
ans = R[i] - min_R
elif min_R > R[i]:
if ans < R[i]-min_R:
ans = R[i] - min_R
min_R = R[i]
else:
if ans < 0
ans = 0
print ans
|
s598468151 | p02258 | u463990569 | 1482172073 | Python | Python3 | py | Runtime Error | 60 | 7700 | 262 | n = int(input())
stack = []
for _ in range(n):
stack.append(int(input()))
candidate = []
for i, v in enumerate(stack):
for j in [el for el in stack[:i] if v > el]:
candidate.append(v - j)
candidate = [max(candidate)]
print(candidate[0]) |
s200423866 | p02258 | u463990569 | 1482173138 | Python | Python3 | py | Runtime Error | 0 | 0 | 246 | n = int(input())
stack = []
for _ in range(n):
stack.append(int(input()))
for i in range(len(stack) - 1):
for r1, r2 in zip(stack[::1], stack[i::1]):
candidate.append(r2 - r3)
candidate = [max(candidate)]
print(candidate[0]) |
s356194033 | p02258 | u463990569 | 1482173170 | Python | Python3 | py | Runtime Error | 0 | 0 | 246 | n = int(input())
stack = []
for _ in range(n):
stack.append(int(input()))
for i in range(len(stack) - 1):
for r1, r2 in zip(stack[::1], stack[i::1]):
candidate.append(r2 - r1)
candidate = [max(candidate)]
print(candidate[0]) |
s997592575 | p02258 | u508732591 | 1483770438 | Python | Python3 | py | Runtime Error | 0 | 0 | 244 | import sys
n = int(input())
minv = int(input())
maxv = -1000000000
for r in map(int,sys.stdin.readlines()):
if maxv < r-minv < 0:
maxv = r-minv
minv = r
elif maxv < r-minv:
maxv = r-minv
elif m < 0:
minv = r
print(maxv) |
s841033082 | p02258 | u508732591 | 1483770519 | Python | Python3 | py | Runtime Error | 0 | 0 | 244 | import sys
n = int(input())
minv = int(input())
maxv = -1000000000
for r in map(int,sys.stdin.readlines()):
if maxv < r-minv < 0:
maxv = r-minv
minv = r
elif maxv < r-minv:
maxv = r-minv
elif m < 0:
minv = r
print(maxv) |
s370882826 | p02258 | u508732591 | 1483770713 | Python | Python3 | py | Runtime Error | 0 | 0 | 208 | import sys
n = int(input())
minv = int(input())
maxv = -1000000000
for r in map(int,sys.stdin.readlines()):
m = r-minv
if maxv < m: maxv = m
if m < 0: minv = r
elif m < 0: minv = r
print(maxv) |
s832638744 | p02258 | u918276501 | 1484797341 | Python | Python3 | py | Runtime Error | 0 | 0 | 113 | import sys
input()
a,b=-1e11,1e11
for i in map(int,sys.stdin.readlines()):
a=max(a,i-b)
b=min(i,b)
print(mar) |
s558650063 | p02258 | u144068724 | 1487091897 | Python | Python3 | py | Runtime Error | 0 | 0 | 222 | n = int(input())
R = [int(input()) for i in range(n)]
profit= R[1] - R[0]
for i in range(n):
for j in range(i+1,n):
tmp = R[j]-R[i]
if profit < tmp:
profit = tmp
print(max(profit)) |
s679320373 | p02258 | u144068724 | 1487091929 | Python | Python3 | py | Runtime Error | 0 | 0 | 222 | n = int(input())
R = [int(input()) for i in range(n)]
profit= R[1] - R[0]
for i in range(n):
for j in range(i+1,n):
tmp = R[j]-R[i]
if profit < tmp:
profit = tmp
print(max(profit)) |
s342172964 | p02258 | u848688448 | 1487941234 | Python | Python3 | py | Runtime Error | 50 | 14404 | 233 | import sys
num = int(input())
input_line = sys.stdin.readlines()
inputnum = [int(x.strip()) for x in input_line]
diff = []
for j in range(num):
for i in range(j):
diff.append(inputnum[j] - inputnum[i])
print(max(*diff)) |
s694256163 | p02258 | u893511382 | 1488963395 | Python | Python3 | py | Runtime Error | 0 | 0 | 131 |
for i in R[1:]:
max_p = -10^ 9
min_p = 10 ^ 9
max_p = max(i - min_p, max_p)
min_p = min(min_p, i)
return max_p |
s362332109 | p02258 | u810591206 | 1492787917 | Python | Python3 | py | Runtime Error | 0 | 0 | 174 | import numpy as np
n = int(input())
l = np.zeros(n)
for i in range(n):
l[i] = int(input())
x = [l[j] - l[i] for j in range(1, n) for i in range(j)]
print(int(max(x))) |
s717006120 | p02258 | u213265973 | 1494488991 | Python | Python3 | py | Runtime Error | 0 | 0 | 224 | n = int(input())
r_min = int(input())
r_t = int(input())
g_max = r_t - r_min
r_ min = min(r_min, r_t)
for _ in range(n-2):
r_t = int(input())
g_max = max(g_max, r_t - r_min)
r_min = min(r_min,r_t)
print(g_max) |
s245366890 | p02258 | u213265973 | 1494489069 | Python | Python3 | py | Runtime Error | 0 | 0 | 224 | n = int(input())
r_min = int(input())
r_t = int(input())
g_max = r_t - r_min
r_ min = min(r_min, r_t)
for _ in range(n-2):
r_t = int(input())
g_max = max(g_max, r_t - r_min)
r_min = min(r_min, r_t)
print(g_max) |
s455353532 | p02258 | u213265973 | 1494489133 | Python | Python3 | py | Runtime Error | 0 | 0 | 225 | n = int(input())
r_min = int(input())
r_t = int(input())
g_max = r_t - r_min
r_ min = min(r_min, r_t)
for _ in range(n-2):
r_t = int(input())
g_max = max(g_max, r_t - r_min)
r_min = min(r_min, r_t)
print(g_max) |
s452059405 | p02258 | u213265973 | 1494489166 | Python | Python3 | py | Runtime Error | 0 | 0 | 225 | n = int(input())
r_min = int(input())
r_t = int(input())
g_max = r_t - r_min
r_ min = min(r_min, r_t)
for _ in range(n-2):
r_t = int(input())
g_max = max(g_max, r_t - r_min)
r_min = min(r_min, r_t)
print(g_max) |
s804290844 | p02258 | u213265973 | 1494489211 | Python | Python3 | py | Runtime Error | 0 | 0 | 225 | n = int(input())
r_min = int(input())
r_t = int(input())
g_max = r_t - r_min
r_ min = min(r_min, r_t)
for _ in range(n-2):
r_t = int(input())
g_max = max(g_max, r_t - r_min)
r_min = min(r_min, r_t)
print(g_max) |
s785683559 | p02258 | u213265973 | 1494489216 | Python | Python3 | py | Runtime Error | 0 | 0 | 225 | n = int(input())
r_min = int(input())
r_t = int(input())
g_max = r_t - r_min
r_ min = min(r_min, r_t)
for _ in range(n-2):
r_t = int(input())
g_max = max(g_max, r_t - r_min)
r_min = min(r_min, r_t)
print(g_max) |
s614886594 | p02258 | u939814144 | 1494910880 | Python | Python3 | py | Runtime Error | 0 | 0 | 328 | import sys
def get_maximum_profit:
element_number = int(input())
v0 = int(input())
v1 = int(input())
min_v = v0
max_profit = v1-v0
for i in map(int, sys.stdin.readlines()):
min_v = min(min_v, i)
max_profit = max(max_profit, i-min_v)
if __name__ == '__main__':
get_maximum_profit() |
s653584723 | p02258 | u279605379 | 1495278498 | Python | Python3 | py | Runtime Error | 0 | 0 | 322 | n=int(input())
fir=int(input())
sec=int(input())
max=sec
if(fir>sec):
min=sec
elif(fir<=sec):
min=fir
max_dif=sec-fir
for i in range(n-2):
x=int(input())
if x>max_num:
max_num = x
if max_dif < x-min:
max_dif = x-min
if x<min:
min = x
max_num=1
print(max_dif) |
s808909110 | p02258 | u279605379 | 1495278558 | Python | Python3 | py | Runtime Error | 0 | 0 | 322 | n=int(input())
fir=int(input())
sec=int(input())
max=sec
if(fir>sec):
min=sec
elif(fir<=sec):
min=fir
max_dif=sec-fir
for i in range(n-2):
x=int(input())
if x>max_num:
max_num = x
if max_dif < x-min:
max_dif = x-min
if x<min:
min = x
max_num=1
print(max_dif) |
s411001522 | p02258 | u279605379 | 1495278637 | Python | Python3 | py | Runtime Error | 0 | 0 | 322 | n=int(input())
fir=int(input())
sec=int(input())
max=sec
if(fir>sec):
min=sec
elif(fir<=sec):
min=fir
max_dif=sec-fir
for i in range(n-2):
x=int(input())
if x>max_num:
max_num = x
if max_dif < x-min:
max_dif = x-min
if x<min:
min = x
max_num=1
print(max_dif) |
s180281234 | p02258 | u279605379 | 1495278709 | Python | Python3 | py | Runtime Error | 0 | 0 | 366 | n=int(input())
fir=int(input())
sec=int(input())
max=sec
if(fir>sec):
min=sec
elif(fir<=sec):
min=fir
max_dif=sec-fir
if n>2:
for i in range(n-2):
x=int(input())
if x>max_num:
max_num = x
if max_dif < x-min:
max_dif = x-min
if x<min:
min = x
max_num=1
print(max_dif) |
s321112454 | p02258 | u279605379 | 1495279099 | Python | Python3 | py | Runtime Error | 0 | 0 | 373 | n=int(input())
fir=int(input())
sec=int(input())
max_=sec
if(fir>sec):
min_=sec
elif(fir<=sec):
min_=fir
max_dif=sec-fir
if n>2:
for i in range(n-2):
x=int(input())
if x>max_num:
max_num = x
if max_dif < x-min_:
max_dif = x-min_
if x<min_:
min_ = x
max_num=1
print(max_dif) |
s877160223 | p02258 | u279605379 | 1495279180 | Python | Python3 | py | Runtime Error | 0 | 0 | 373 | n=int(input())
fir=int(input())
sec=int(input())
max_=sec
if(fir>sec):
min_=sec
elif(fir<=sec):
min_=fir
max_dif=sec-fir
if n>2:
for i in range(n-3):
x=int(input())
if x>max_num:
max_num = x
if max_dif < x-min_:
max_dif = x-min_
if x<min_:
min_ = x
max_num=1
print(max_dif) |
s316175280 | p02258 | u626838615 | 1496062983 | Python | Python3 | py | Runtime Error | 0 | 0 | 283 | import math
n = int(input())
r = [None] * n
min = math.inf
max = -math.inf
for i in range(n):
r[i] = int(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) |
s185136163 | p02258 | u905313459 | 1496229511 | Python | Python3 | py | Runtime Error | 0 | 0 | 256 | n = int(input())
l = [int(input()) for i in range(n)][::-1]
maximum = l[0] - min(l[1:])
if maximum > 0:
x = [i for i in l if l[0] <= i]
for j in range(len(x)-1):
if maximum < l[j] - min(l[j+1:]):
maximum = l[j] - min(l[j+1:])
input(maximum) |
s070837008 | p02258 | u905313459 | 1496229558 | Python | Python3 | py | Runtime Error | 0 | 0 | 262 | n = int(input())
l = [int(input()) for i in range(n)][::-1]
maximum = l[0] - min(l[1:])
x = l
if maximum > 0:
x = [i for i in l if l[0] <= i]
for j in range(len(x)-1):
if maximum < l[j] - min(l[j+1:]):
maximum = l[j] - min(l[j+1:])
input(maximum) |
s931945513 | p02258 | u905313459 | 1496230055 | Python | Python3 | py | Runtime Error | 0 | 0 | 268 | n = int(input())
l = [int(input()) for i in range(n)]
l = l[::-1]
maximum = l[0] - min(l[1:])
x = l
if maximum > 0:
x = [i for i in l if l[0] <= i]
for j in range(len(x)-1):
if maximum < l[j] - min(l[j+1:]):
maximum = l[j] - min(l[j+1:])
input(maximum) |
s531804054 | p02258 | u492906552 | 1496383217 | Python | Python3 | py | Runtime Error | 0 | 0 | 488 | day = int(input('Please enter the number of day '))
buy = []
for i in range(day):
buy.append(int(input('Please enter the buying price of Day '+str(i+1)+' ')))
sell = []
for i in range(day):
sell.append(int(input('Please enter the selling price of Day '+str(i+1)+' ')))
max_table=[]
for i in range(day):
table=[]
for j in range(day):
if i <= j:
pro = sell[j]-buy[i]
table.append(pro)
max_table.append(max(table))
print(max(max_table)) |
s270369298 | p02258 | u256678932 | 1496906249 | Python | Python3 | py | Runtime Error | 0 | 0 | 322 | def main():
n = int(input())
nums = []
for i in range(n):
nums.append(int(input()))
r = max(nums[1:]) - nums[0]
for i in range(1, n-1):
ri = nums[i]
if ri == rj:
rj = max(nums[i+1:])
r = max(r, rj-ri)
print(r)
if __name__ == '__main__':
main() |
s579208894 | p02258 | u256678932 | 1496906304 | Python | Python3 | py | Runtime Error | 0 | 0 | 322 | def main():
n = int(input())
nums = []
for i in range(n):
nums.append(int(input()))
r = max(nums[1:]) - nums[0]
for i in range(1, n-1):
ri = nums[i]
if ri == rj:
rj = max(nums[i+1:])
r = max(r, rj-ri)
print(r)
if __name__ == '__main__':
main() |
s218819325 | p02258 | u747635679 | 1497995391 | Python | Python3 | py | Runtime Error | 0 | 0 | 173 | import math
maxv = -inf
minv = inf
n = int(input())
for i in range(n):
tmp = int(input())
maxv = max(maxv, tmp - minv)
minv = min(tmp, minv)
print(maxv) |
s118097817 | p02258 | u747635679 | 1497995615 | Python | Python3 | py | Runtime Error | 0 | 0 | 160 | maxv = -inf
minv = inf
n = int(input())
for i in range(n):
tmp = int(input())
maxv = max(maxv, tmp - minv)
minv = min(tmp, minv)
print(maxv) |
s833539891 | p02258 | u311299757 | 1500102017 | Python | Python3 | py | Runtime Error | 0 | 0 | 310 | v = []
v = str(inp).splitlines()
dif_max = -200000
for i in range(len(v) ):
v[i] = int(v[i])
for i in range(len(v) - 1):
for j in range(i + 1, len(v), 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s862275760 | p02258 | u311299757 | 1500102240 | Python | Python3 | py | Runtime Error | 0 | 0 | 260 | v = str(input()).splitlines()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
for i in range(1,v[0],1):
for j in range(i+1, v[0], 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s584502245 | p02258 | u311299757 | 1500102249 | Python | Python3 | py | Runtime Error | 0 | 0 | 265 | v=[]
v = str(input()).splitlines()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
for i in range(1,v[0],1):
for j in range(i+1, v[0], 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s632782261 | p02258 | u311299757 | 1500102577 | Python | Python3 | py | Runtime Error | 0 | 0 | 288 | v = []
v = str(input()).splitlines()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
len = v[0]
for i in range(2, len + 1, 1):
for j in range(i + 1, len + 1, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s077773798 | p02258 | u311299757 | 1500102900 | Python | Python3 | py | Runtime Error | 0 | 0 | 285 | v = []
v = str(inp).splitlines()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
len = v[0]
for i in range(2, len + 1, 1):
for j in range(i + 1, len + 1, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s940782374 | p02258 | u311299757 | 1500102913 | Python | Python3 | py | Runtime Error | 0 | 0 | 289 | v = []
v = str(input()).splitlines()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
len = v[0]
for i in range(2, len + 1, 1):
for j in range(i + 1, len + 1, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s964791302 | p02258 | u311299757 | 1500103225 | Python | Python3 | py | Runtime Error | 0 | 0 | 284 | v = []
v = str(input()).split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
len = v[0]
for i in range(2, len + 1, 1):
for j in range(i + 1, len + 1, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s530151405 | p02258 | u311299757 | 1500103302 | Python | Python3 | py | Runtime Error | 0 | 0 | 284 | v = []
v = str(input()).split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
len = v[0]
for i in range(2, len + 1, 1):
for j in range(i + 1, len + 1, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s334152796 | p02258 | u311299757 | 1500103318 | Python | Python3 | py | Runtime Error | 0 | 0 | 284 | v = []
v = str(input()).split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
len = v[0]
for i in range(2, len + 1, 1):
for j in range(i + 1, len + 1, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s286471641 | p02258 | u311299757 | 1500103379 | Python | Python3 | py | Runtime Error | 0 | 0 | 121 | v = []
v = str(input()).split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
print("{}".format(v[3])) |
s416316656 | p02258 | u311299757 | 1500103437 | Python | Python3 | py | Runtime Error | 0 | 0 | 279 | v = []
v = str(input()).split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
l = v[0]
for i in range(2, l + 1, 1):
for j in range(i + 1, l + 1, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s074153964 | p02258 | u311299757 | 1500103472 | Python | Python3 | py | Runtime Error | 0 | 0 | 277 | v = str(input()).split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
len = v[0]
for i in range(2, len + 1, 1):
for j in range(i + 1, len + 1, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s677096365 | p02258 | u311299757 | 1500103563 | Python | Python3 | py | Runtime Error | 0 | 0 | 277 | v = str(input()).split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
len = v[0]
for i in range(2, len + 1, 1):
for j in range(i + 1, len + 1, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s210464285 | p02258 | u311299757 | 1500103698 | Python | Python3 | py | Runtime Error | 0 | 0 | 269 | v = str(input()).split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
len = v[0]
for i in range(2, len, 1):
for j in range(i + 1, len, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print("{}".format(dif_max)) |
s244994891 | p02258 | u311299757 | 1500103742 | Python | Python3 | py | Runtime Error | 0 | 0 | 101 | v = str(input()).split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
print(v[2]) |
s138692045 | p02258 | u311299757 | 1500103761 | Python | Python3 | py | Runtime Error | 0 | 0 | 106 | v=[]
v = str(input()).split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
print(v[2]) |
s265941668 | p02258 | u311299757 | 1500103785 | Python | Python3 | py | Runtime Error | 0 | 0 | 60 | v=[]
v = str(input()).split()
dif_max = -200000
print(v[2]) |
s306446831 | p02258 | u311299757 | 1500103911 | Python | Python3 | py | Runtime Error | 0 | 0 | 60 | v=[]
v = str(input()).split()
dif_max = -200000
print(v[2]) |
s318386739 | p02258 | u311299757 | 1500103975 | Python | Python3 | py | Runtime Error | 0 | 0 | 42 | v=[]
v = str(input()).split()
print(v[2]) |
s821796359 | p02258 | u311299757 | 1500103990 | Python | Python3 | py | Runtime Error | 0 | 0 | 39 | v = []
v = input().split()
print(v[2]) |
s653172988 | p02258 | u311299757 | 1500104038 | Python | Python3 | py | Runtime Error | 0 | 0 | 260 | v = str(inp).split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
len = v[0]
for i in range(2, len + 1, 1):
for j in range(i + 1, len + 1, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print(dif_max) |
s878043194 | p02258 | u311299757 | 1500104403 | Python | Python3 | py | Runtime Error | 0 | 0 | 84 | cnt = int(input())
v = []
for i in range(cnt):
v[i] = int(input())
print(v[1]) |
s049373183 | p02258 | u311299757 | 1500105970 | Python | Python3 | py | Runtime Error | 0 | 0 | 259 | v = input().split()
dif_max = -200000
for i in range(len(v)):
v[i] = int(v[i])
len = v[0]
for i in range(2, len + 1, 1):
for j in range(i + 1, len + 1, 1):
dif = v[j] - v[i]
dif_max = dif if dif_max < dif else dif_max
print(dif_max) |
s612620919 | p02258 | u387437217 | 1500429644 | Python | Python3 | py | Runtime Error | 0 | 0 | 255 | num=int(input())
r_1=int(input())
r_2=int(input())
max_profit=r_2 - r_1
min_value=min(r_1,r_2)
for i in range(n-2):
x=int(input())
t=x - min_value
if max_profit>t:
max_profit=t
if x<min_value:
min_value=x
print(max_profit) |
s426812639 | p02258 | u387437217 | 1500430017 | Python | Python3 | py | Runtime Error | 0 | 0 | 295 | num=int(input())
r_1=int(input())
r_2=int(input())
max_profit=r_2 - r_1
if r_1<r_2:
min_value=r_1
else:
min_value=r_2
for i in range(n-2):
x=int(input())
t=x - min_value
if max_profit<t:
max_profit=t
if x<min_value:
min_value=x
print(max_profit) |
s665226319 | p02258 | u491916705 | 1502088197 | Python | Python | py | Runtime Error | 10 | 6456 | 231 | n = int(raw_input())
a = []
for i in range(n):
a.append(int(raw_input()))
max = a[1] - a[0]
min_num = a[0]
for i in a:
if a[i] - min_num > max:
max = a[i] - min_num
if min_num > i:
min_num = i
print max |
s014214002 | p02258 | u071759777 | 1506095586 | Python | Python3 | py | Runtime Error | 0 | 0 | 166 | i = 0
n = int(input())
maxR = -10**9
minR = int(input())
while i < n:
R = int(input())
maxR = max(maxR, R-minR)
minR = min(minR, R)
i += 1
print(maxR) |
s890990246 | p02258 | u626266743 | 1508855709 | Python | Python3 | py | Runtime Error | 0 | 0 | 179 | n, a = map(int, input().split())
Max = -1000000
Min = a
for i in range(n):
x = input()
if (Max < (x-Min)):
Max = x-Min
if (x < Min):
Min = x
print(Max) |
s528725040 | p02258 | u626266743 | 1508855725 | Python | Python3 | py | Runtime Error | 0 | 0 | 184 | n, a = map(int, input().split())
Max = -1000000
Min = a
for i in range(n):
x = int(input())
if (Max < (x-Min)):
Max = x-Min
if (x < Min):
Min = x
print(Max) |
s640431586 | p02258 | u626266743 | 1508855918 | Python | Python3 | py | Runtime Error | 0 | 0 | 185 | n, a = map(int, input().split())
Max = -10000000
Min = a
for i in range(n):
x = int(input())
if (Max < (x-Min)):
Max = x-Min
if (x < Min):
Min = x
print(Max) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.