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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s614147326 | p02258 | u834416077 | 1452490922 | Python | Python | py | Runtime Error | 0 | 0 | 184 | n = int(raw_input())
maxv = -10**9
minv = 10**9
for j in range(n-1):
nums = int(raw_input())
diff = nums - minv
maxv = max(maxv,diff)
minv = min(minv,nums)
print maxv |
s827006974 | p02258 | u724923896 | 1452490935 | Python | Python | py | Runtime Error | 0 | 0 | 143 | n = input()
max = -10**9
min = R[]
for i in range(0, n-1):
if R[i] <= min:
min = R[i]
if max <= R[i] - min:
max = R[i] - min
print max |
s416474325 | p02258 | u724923896 | 1452490991 | Python | Python | py | Runtime Error | 0 | 0 | 159 | n = input()
max = -10**9
min = R[]
for i in range(0, n-1):
R[i] = input()
if R[i] <= min:
min = R[i]
if max <= R[i] - min:
max = R[i] - min
print max |
s268060776 | p02258 | u834416077 | 1452491334 | Python | Python | py | Runtime Error | 0 | 0 | 183 | n = int(raw_input())
maxv = -1*10**9
minv = 10**9
for j in range(n-1):
num = int(raw_input())
diff = num - minv
maxv = max(maxv,diff)
minv = min(minv,num)
print maxv |
s134355969 | p02258 | u724923896 | 1452491343 | Python | Python | py | Runtime Error | 0 | 0 | 159 | n = input()
max = -10**9
min = 0
for i in range(0, n-1):
R[i] = input()
if R[i] <= min:
min = R[i]
if max <= R[i] - min:
max = R[i] - min
print max |
s523973728 | p02258 | u834416077 | 1452491413 | Python | Python | py | Runtime Error | 0 | 0 | 194 | n = int(raw_input())
maxv = -1*10**9
minv = int(raw_input())
for j in range(n-1):
num = int(raw_input())
diff = num - minv
maxv = max(maxv,diff)
minv = min(minv,num)
print maxv |
s634233159 | p02258 | u834416077 | 1452491474 | Python | Python | py | Runtime Error | 0 | 0 | 179 | n = int(raw_input())
maxv = -1*10**9
minv = int(raw_input())
for j in range(n-1):
num = int(raw_input())
maxv = max(maxv,num - minv)
minv = min(minv,num)
print maxv |
s349868672 | p02258 | u724923896 | 1452491520 | Python | Python | py | Runtime Error | 0 | 0 | 159 | n = input()
max = -10**9
min = 0
for i in range(0, n-1):
R[i] = input()
if R[i] <= min:
min = R[i]
if max <= R[i] - min:
max = R[i] - min
print max |
s518050368 | p02258 | u834416077 | 1452491574 | Python | Python | py | Runtime Error | 0 | 0 | 183 | n = int(raw_input())
maxv = -1*10**9
minv = int(raw_input())
for j in range(n-1):
num = int(raw_input())
maxv = max(maxv, num - minv)
minv = min(minv, num)
print maxv |
s783549142 | p02258 | u724923896 | 1452491583 | Python | Python | py | Runtime Error | 0 | 0 | 188 | n = input()
max = -10**9
for i in range(0, n-1):
R[i] = input()
min = R[0]
for i in range(0, n-1):
if R[i] <= min:
min = R[i]
if max <= R[i] - min:
max = R[i] - min
print max |
s362690269 | p02258 | u834416077 | 1452491654 | Python | Python | py | Runtime Error | 0 | 0 | 190 | n = int(raw_input())
maxv = -1*10**9
minv = int(raw_input())
for j in range(n-1):
num = int(raw_input())
maxv = max(maxv, num - minv)
minv = min(minv, num)
print maxv |
s838396861 | p02258 | u834416077 | 1452491691 | Python | Python | py | Runtime Error | 0 | 0 | 179 | n = int(raw_input())
maxv = -1*10**9
minv = 10**9
for j in range(n-1):
num = int(raw_input())
maxv = max(maxv, num - minv)
minv = min(minv, num)
print maxv |
s721063498 | p02258 | u724923896 | 1452491704 | Python | Python | py | Runtime Error | 0 | 0 | 145 | n = input()
max = -10**9
min = input()
for i in range(n-1):
if R[i] <= min:
min = R[i]
if max <= R[i] - min:
max = R[i] - min
print max |
s096662243 | p02258 | u834416077 | 1452491728 | Python | Python | py | Runtime Error | 0 | 0 | 179 | n = int(raw_input())
maxv = -1*10**9
minv = 10**9
for i in range(n-1):
num = int(raw_input())
maxv = max(maxv, num - minv)
minv = min(minv, num)
print maxv |
s826189868 | p02258 | u047737909 | 1452492341 | Python | Python | py | Runtime Error | 0 | 0 | 194 | n = int(raw_input())
l = set()
max = -10^9
x=0
for i in range(n-1)
l.add(int(raw_input())
for s in range(n-1)
for t in range(s-1)
x= l[n-s]-l[n-t]
if max<x:
max=x
printf('%d')%(max) |
s020198128 | p02258 | u724923896 | 1452492613 | Python | Python | py | Runtime Error | 0 | 0 | 187 | n = input()
max = -10**9
for i in range(0, n-1):
R[i] = input()
min = R[0]
for i in range(0, n-1):
if R[i] <= min:
min = R[i]
if max <= R[i] - min:
max = R[i] - min
print max |
s651863503 | p02258 | u047737909 | 1452492615 | Python | Python | py | Runtime Error | 0 | 0 | 198 | n = int(raw_input())
l = set()
max = -10^9
x=0
for i in range(n-1)
l.add(int(raw_input())
for s in range(n-1)
for t in range(s-1)
x= l[n-s-1]-l[n-t-1]
if max<x:
max=x
printf('%d')%(max) |
s679346033 | p02258 | u724923896 | 1452492663 | Python | Python | py | Runtime Error | 0 | 0 | 187 | n = input()
max = -10**9
for i in range(0, n-1):
R[i] = input()
min = R[0]
for i in range(0, n-1):
if R[i] <= min:
min = R[i]
if max <= R[i] - min:
max = R[i] - min
print max |
s928197309 | p02258 | u047737909 | 1452492717 | Python | Python | py | Runtime Error | 0 | 0 | 198 | n = int(raw_input())
l = []
max = -10^9
x=0
for i in range(n-1)
l.append(int(raw_input())
for s in range(n-1)
for t in range(s-1)
x= l[n-s-1]-l[n-t-1]
if max<x:
max=x
printf('%d')%(max) |
s418681224 | p02258 | u724923896 | 1452492794 | Python | Python | py | Runtime Error | 0 | 0 | 203 | n = input()
n_max = -10**9
for i in range(0, n-1):
R[i] = input()
n_min = R[0]
for i in range(0, n-1):
if R[i] <= n_min:
n_min = R[i]
if max <= R[i] - n_min:
n_max = R[i] - n_min
print n_max |
s003347709 | p02258 | u724923896 | 1452492837 | Python | Python | py | Runtime Error | 0 | 0 | 205 | n = input()
n_max = -10**9
for i in range(0, n-1):
R[i] = input()
n_min = R[0]
for i in range(0, n-1):
if R[i] <= n_min:
n_min = R[i]
if n_max <= R[i] - n_min:
n_max = R[i] - n_min
print n_max |
s580350557 | p02258 | u047737909 | 1452492972 | Python | Python | py | Runtime Error | 0 | 0 | 203 | n = int(raw_input())
l = []
max = -10^9
x=0
for i in range(n-1):
l.append(int(raw_input())
for s in range(n-1):
for t in range(s-1):
x= l[n-s-1] - l[n-t-1]
if max<x:
max=x
printf('%d')%(max) |
s614509873 | p02258 | u047737909 | 1452493250 | Python | Python | py | Runtime Error | 0 | 0 | 188 | n = int(raw_input())
l = []
max = -10^9
x=0
for i in (n-1):
l.append(int(raw_input())
for s in (n-1):
for t in (s-1):
x= l[n-s-1] - l[n-t-1]
if max<x:
max=x
printf('%d')%(max) |
s826122466 | p02258 | u047737909 | 1452493415 | Python | Python | py | Runtime Error | 0 | 0 | 201 | n = int(raw_input())
l = []
max = -10^9
x=0
for i in range(n-1):
l.append(int(raw_input())
for s in range(n-1):
for t in range(s-1):
x= l[n-s-1] - l[n-t-1]
if max<x:
max=x
printf'%d'%(max) |
s625517701 | p02258 | u047737909 | 1452493546 | Python | Python | py | Runtime Error | 0 | 0 | 200 | n = int(raw_input())
l = []
max = -10^9
x=0
for i in range(n-1):
l.append(int(raw_input())
for s in range(n-1):
for t in range(s-1):
x= l[n-s-1] - l[n-t-1]
if max<x:
max=x
print'%d'%(max) |
s035227912 | p02258 | u834416077 | 1452494038 | Python | Python | py | Runtime Error | 0 | 0 | 205 | n = int(raw_input())
maxv = -1*10**9
minv = 10**9
for j in range(n-1):
num = int(raw_input())
if maxv < num - minv:
maxv = num -minv
if minv > num:
minv = num
print maxv |
s775568857 | p02258 | u834416077 | 1452494067 | Python | Python | py | Runtime Error | 0 | 0 | 205 | n = int(raw_input())
maxv = -1*10**9
minv = 10**9
for j in range(n-1):
num = int(raw_input())
if maxv < num - minv:
maxv = num -minv
if minv > num:
minv = num
print maxv |
s492183084 | p02258 | u834416077 | 1452494142 | Python | Python | py | Runtime Error | 0 | 0 | 205 | n = int(raw_input())
maxv = -1*10**9
minv = 10**9
for j in range(n-1):
num = int(raw_input())
if maxv < num - minv:
maxv = num -minv
if minv > num:
minv = num
print maxv |
s395816679 | p02258 | u834416077 | 1452494252 | Python | Python | py | Runtime Error | 0 | 0 | 187 | n = input()
maxv = -1*10**9
minv = 10**9
for j in range(n-1):
num = input()
if maxv < num - minv:
maxv = num -minv
if minv > num:
minv = num
print maxv |
s125081166 | p02258 | u834416077 | 1452494342 | Python | Python | py | Runtime Error | 0 | 0 | 190 | n = input()
maxv = -1*10**9
minv = input()
for j in range(n-1):
num = input()
if maxv < num - minv:
maxv = num - minv
if minv > num:
minv = num
print maxv |
s496058667 | p02258 | u834416077 | 1452494382 | Python | Python | py | Runtime Error | 0 | 0 | 190 | n = input()
maxv = -1*10**9
minv = 10**9
for j in range(0, n-1):
num = input()
if maxv < num - minv:
maxv = num -minv
if minv > num:
minv = num
print maxv |
s597355256 | p02258 | u834416077 | 1452494569 | Python | Python | py | Runtime Error | 0 | 0 | 198 | n = input()
maxv = -1*10**9
minv = input()
for j in range(0, n-1):
nums = input()
if maxv < nums - minv:
maxv = nums - minv
if nums < minv:
minv = nums
print maxv |
s080190427 | p02258 | u834416077 | 1452494678 | Python | Python | py | Runtime Error | 0 | 0 | 174 | n = input()
max = -1*10**9
min = input()
for i in range(0, n-1):
a = input()
if max < a - min:
max = a - min
if a < min:
min = a
print max |
s833424932 | p02258 | u834416077 | 1452494743 | Python | Python | py | Runtime Error | 0 | 0 | 174 | n = input()
max = -(10**9)
min = input()
for i in range(0, n-1):
a = input()
if max < a - min:
max = a - min
if a < min:
min = a
print max |
s541631093 | p02258 | u834416077 | 1452495630 | Python | Python | py | Runtime Error | 0 | 0 | 173 | n = input()
max = -(10**9)
min = input()
for i in range(0, n-1):
a = input()
if max < a - min:
max = a - min
if a < min
min = a
print max |
s846019974 | p02258 | u834416077 | 1452495726 | Python | Python | py | Runtime Error | 0 | 0 | 191 | n = input()
n_max = -(10**9)
n_min = input()
for i in range(0, n-1):
R = input()
if n_max < R - n_min:
n_max = R - n_min
if R < n_min
n_min = R
print n_max |
s049495580 | p02258 | u834416077 | 1452495786 | Python | Python | py | Runtime Error | 0 | 0 | 185 | n = input()
n_max = -(10**9)
n_min = input()
for i in range(0, n-1):
R = input()
if n_max < R - n_min:
n_max = R - n_min
if R < n_min:
n_min = R
print n_max |
s496202138 | p02258 | u834416077 | 1452495833 | Python | Python | py | Runtime Error | 0 | 0 | 188 | n = input()
n_max = -1000000000
n_min = input()
for i in range(0, n-1):
R = input()
if n_max < R - n_min:
n_max = R - n_min
if R < n_min:
n_min = R
print n_max |
s429937661 | p02258 | u834416077 | 1452495916 | Python | Python | py | Runtime Error | 0 | 0 | 190 | n = input()
n_max = -(1000000000)
n_min = input()
for i in range(0, n-1):
R = input()
if n_max < R - n_min:
n_max = R - n_min
if R < n_min:
n_min = R
print n_max |
s753438070 | p02258 | u834416077 | 1452496257 | Python | Python | py | Runtime Error | 0 | 0 | 214 | n = int(raw_input())
minv = int(raw_input())
maxv = -1*10**9
for j in range(n-1):
nums = int(raw_input())
diff = nums - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = nums
print maxv |
s947245724 | p02258 | u047737909 | 1452498569 | Python | Python | py | Runtime Error | 0 | 0 | 209 | n = int(raw_input())
max = -10^9
min = 10^9
ans = -10^9
for i in range(n):
x[i] = int(raw_input())
for s in range(n-1):
for t in range(n-1):
if ans < (x[n-1-s]-x[n-1-t]):
ans=x[n-1-s]-x[n-1-t]
print ans |
s362256895 | p02258 | u047737909 | 1452498630 | Python | Python | py | Runtime Error | 0 | 0 | 205 | n = int(raw_input())
max = -10^9
min = 10^9
ans = -10^9
for i in range(n):
x[i] = int(raw_input())
for s in range(n):
for t in range(n):
if ans < (x[n-1-s]-x[n-1-t]):
ans=x[n-1-s]-x[n-1-t]
print ans |
s136988510 | p02258 | u967035362 | 1452569655 | Python | Python | py | Runtime Error | 0 | 0 | 208 | n = (int)input()
while n > 0:
a[n] = (int)input()
j = 1
i = 0
max = a[j]-a[i]
while i < n:
while j < n:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+ = 1
i+ = 1
print "max"
|
s562815426 | p02258 | u967035362 | 1452569959 | Python | Python | py | Runtime Error | 0 | 0 | 203 | n = (int)input()
while n > 0:
a[n] = (int)input()
j = 1
i = 0
max = a[j]-a[i]
while i < n:
while j < n:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+ = 1
i+ = 1
print "max" |
s654376447 | p02258 | u967035362 | 1452570105 | Python | Python | py | Runtime Error | 0 | 0 | 218 | n = (int)input()
i = 0
while n > i:
a[i] = (int)input()
i+=1
j = 1
i = 0
max = a[j]-a[i]
while i < n:
while j < n:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+ = 1
i+ = 1
print "max" |
s155065538 | p02258 | u967035362 | 1452570286 | Python | Python | py | Runtime Error | 0 | 0 | 221 | n = (int)input()
i = 0
while n > i:
a.append((int)input())
i+=1
j = 1
i = 0
max = a[j]-a[i]
while i < n:
while j < n:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+ = 1
i+ = 1
print "max" |
s372467609 | p02258 | u967035362 | 1452572746 | Python | Python | py | Runtime Error | 0 | 0 | 220 | n = (int)input()
i = 0
while n > i:
a.append((int)input())
i+=1
j = 1
i = 0
max = a[j]-a[i]
while i < n:
while j < n:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+ = 1
i+ = 1
print max |
s583253581 | p02258 | u967035362 | 1452573490 | Python | Python | py | Runtime Error | 0 | 0 | 285 | n = (int)input()
a = []
for i in range(n):
a.append((int)input())
i+=1
for j in range(n):
a.append((int)input())
j+=1
j = 1
i = 0
max = a[j]-a[i]
while i < n:
while j < n:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+ = 1
i+ = 1
print max |
s045037210 | p02258 | u967035362 | 1452573534 | Python | Python | py | Runtime Error | 0 | 0 | 271 | n = (input()
a = []
for i in range(n):
a.append(input())
i+=1
for j in range(n):
a.append(input())
j+=1
j = 1
i = 0
max = a[j]-a[i]
while i < n:
while j < n:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+ = 1
i+ = 1
print max |
s097489788 | p02258 | u967035362 | 1452573578 | Python | Python | py | Runtime Error | 0 | 0 | 271 | n = (input()
a = []
j = 1
i = 0
for i in range(n):
a.append(input())
i+=1
for j in range(n):
a.append(input())
j+=1
max = a[j]-a[i]
while i < n:
while j < n:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+ = 1
i+ = 1
print max |
s908841294 | p02258 | u967035362 | 1452573608 | Python | Python | py | Runtime Error | 0 | 0 | 259 | n = (input()
a = []
for i in range(n):
a.append(input())
i+=1
for j in range(n):
a.append(input())
j+=1
max = a[j]-a[i]
while i < n:
while j < n:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+ = 1
i+ = 1
print max |
s198306610 | p02258 | u967035362 | 1452573623 | Python | Python | py | Runtime Error | 0 | 0 | 247 | n = (input()
a = []
for i in range(n):
a.append(input())
for j in range(n):
a.append(input())
max = a[j]-a[i]
while i < n:
while j < n:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+ = 1
i+ = 1
print max |
s201567319 | p02258 | u967035362 | 1452573638 | Python | Python | py | Runtime Error | 0 | 0 | 249 | n = (input()
a = []
for i in range(n):
a.append(input())
for j in range(n):
a.append(input())
max = a[j]-a[i]
while i < n:
while j < n:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+ = 1
i+ = 1
print max |
s745875710 | p02258 | u967035362 | 1452575294 | Python | Python | py | Runtime Error | 0 | 0 | 205 | n = input():
a = []
a = [input for i in range(n)]
i = 0
j = 1
max = a[j]-a[i]
while n > i:
j = i+1
while n > j:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+=1
i+=1
print max |
s340889061 | p02258 | u967035362 | 1452575345 | Python | Python | py | Runtime Error | 0 | 0 | 208 | n = input()
a = []
a = [input for i in range(n)]
i = 0
j = 1
max = a[j]-a[i]
while n-1 > i:
j = i+1
while n-1 > j:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+=1
i+=1
print max |
s985780484 | p02258 | u967035362 | 1452575359 | Python | Python | py | Runtime Error | 0 | 0 | 204 | n = input()
a = []
a = [input for i in range(n)]
i = 0
j = 1
max = a[j]-a[i]
while n > i:
j = i+1
while n > j:
if max < a[j]-a[i]:
max = a[j]-a[i]
j+=1
i+=1
print max |
s090375742 | p02258 | u038243492 | 1452588860 | Python | Python | py | Runtime Error | 0 | 0 | 147 | n = input()
max = -1 * 10**9
min = input()
for i in range(n-1):
tmp = input()
max = max(maxi, tmp - min)
min = min(mini, tmp)
print max |
s963615653 | p02258 | u456885296 | 1452588869 | Python | Python | py | Runtime Error | 0 | 0 | 180 | n=input()
a = []
for i in range(n):
a.append(int(raw_input())
max= -1*10**9
min = a[0]
for i in range(n-1):
max = max(max, max - a[i])
min = min(min, a[i])
print max
|
s390099307 | p02258 | u456885296 | 1452589568 | Python | Python | py | Runtime Error | 0 | 0 | 187 | n = input()
a = []
for i in range(n):
l.append(int(raw_input())
Min = a[0]
Max = -1*10**9
for j in range(1,N):
Max = max(Max,a[j]-Min)
Min = min(Min,a[j])
print Max |
s761311306 | p02258 | u974554153 | 1452589848 | Python | Python | py | Runtime Error | 0 | 0 | 305 | n=input()
for i in range(n):
if i==0:
num_1=input()
elif i==1:
num_2=input()
maxv=num_2 - num_1
MIN=min(num_1,num_2)
else:
num_3=input()
if (num_3-MIN)>maxv:
maxv=num_3-MIN
if (num_3)<MIN:
MIN=num_3
print(maxv)
|
s015244633 | p02258 | u456885296 | 1452590274 | Python | Python | py | Runtime Error | 0 | 0 | 194 | n = int(raw_input())
a = []
a.append(int(raw_input()))
Min = a[0]
Max = -1*10**9
for j in range(1,n):
a.append(int(raw_input()))
Max = max(Max,R[j]-Min)
Min = min(Min,R[j])
print Max |
s817643678 | p02258 | u424209323 | 1452597601 | Python | Python | py | Runtime Error | 0 | 0 | 176 | num = input()
max = 1 - 1000000000
for i in range (len (num)):
for j in range (len (num)):
if (max > (num[i] - num[j])):
max = num[i] - num[j]
print max |
s806166578 | p02258 | u424209323 | 1452597642 | Python | Python | py | Runtime Error | 0 | 0 | 180 | num = raw_input()
max = 1 - 1000000000
for i in range (len (num)):
for j in range (len (num)):
if (max > (num[i] - num[j])):
max = num[i] - num[j]
print max |
s480203133 | p02258 | u663227983 | 1452597662 | Python | Python | py | Runtime Error | 0 | 0 | 412 | n = input()
m = [0] * n
max = [0] * n
kijun = [0] * n
rieki = [0] * n
max_rieki = 0
for i in xrange(n):
m[i] = input()
for i in xrange(n-1):
max[i] = m[i+1] #0???i
kijun[i] = m[i]
for j in xrange(i+1,n): #1 wo i+1 n-1 wo n-1+i
if max[i] < m[j]:
max[i] = m[j]
rieki[i] = max[i] - kijun[i]
max_rieki = rieki... |
s781161403 | p02258 | u663227983 | 1452597697 | Python | Python | py | Runtime Error | 0 | 0 | 412 | n = input()
m = [0] * n
max = [0] * n
kijun = [0] * n
rieki = [0] * n
max_rieki = 0
for i in xrange(n):
m[i] = input()
for i in xrange(n-1):
max[i] = m[i+1] #0???i
kijun[i] = m[i]
for j in xrange(i+1,n): #1 wo i+1 n-1 wo n-1+i
if max[i] < m[j]:
max[i] = m[j]
rieki[i] = max[i] - kijun[i]
max_rieki = rieki... |
s943002435 | p02258 | u663227983 | 1452597712 | Python | Python | py | Runtime Error | 0 | 0 | 416 | n = input()
m = [0] * n
max = [0] * n
kijun = [0] * n
rieki = [0] * n
max_rieki = 0
for i in xrange(n):
m[i] = raw_input()
for i in xrange(n-1):
max[i] = m[i+1] #0???i
kijun[i] = m[i]
for j in xrange(i+1,n): #1 wo i+1 n-1 wo n-1+i
if max[i] < m[j]:
max[i] = m[j]
rieki[i] = max[i] - kijun[i]
max_rieki = r... |
s540819204 | p02258 | u663227983 | 1452597737 | Python | Python | py | Runtime Error | 0 | 0 | 386 | n = input()
m = [0] * n
max = [0] * n
kijun = [0] * n
rieki = [0] * n
max_rieki = 0
for i in xrange(n):
m[i] = raw_input()
for i in xrange(n-1):
max[i] = m[i+1]
kijun[i] = m[i]
for j in xrange(i+1,n):
if max[i] < m[j]:
max[i] = m[j]
rieki[i] = max[i] - kijun[i]
max_rieki = rieki[0]
for i in xrange(1,n):
... |
s789387925 | p02258 | u424209323 | 1452597882 | Python | Python | py | Runtime Error | 0 | 0 | 194 | num = raw_input()
max = 1 - 1000000000
n = len(input)
for i in range (n - 1):
for j in range (i + 1, n):
if (max > (num[i] - num[j])):
max = num[i] - num[j]
print max |
s694915617 | p02258 | u663227983 | 1452598196 | Python | Python3 | py | Runtime Error | 0 | 0 | 401 | n = input()
m = [0] * n
max = [0] * n
kijun = [0] * n
rieki = [0] * n
max_rieki = 0
for i in xrange(n):
m[i] = input()
for i in xrange(n-1):
max[i] = m[i+1]
kijun[i] = m[i]
for j in xrange(i+1,n):
if max[i] < m[j]:
max[i] = m[j]
rieki[i] = max[i] - kijun[i]
print rieki[i]
max_rieki = rieki[0]
for i in... |
s710030390 | p02258 | u619765879 | 1452599372 | Python | Python | py | Runtime Error | 0 | 0 | 316 | def main(){
int n, max, min, i;
int R[200000];
n = input()
for i in n-1:
R[i] = input()
max = R[1] - R[0]
min = R[0]
for i+1 in n-1:
if R[i]-min>max:
max = R[i] - min
if R[i]<min
min = R[i]
print "%d" % max
return 0
}
|
s059938899 | p02258 | u619765879 | 1452599395 | Python | Python | py | Runtime Error | 0 | 0 | 265 | def main(){
n = input()
for i in n-1:
R[i] = input()
max = R[1] - R[0]
min = R[0]
for i+1 in n-1:
if R[i]-min>max:
max = R[i] - min
if R[i]<min
min = R[i]
print max
return 0
}
|
s931504025 | p02258 | u619765879 | 1452599419 | Python | Python | py | Runtime Error | 0 | 0 | 266 | def main(){
n = input()
for i in n-1:
R[i] = input()
max = R[1] - R[0]
min = R[0]
for i+1 in n-1:
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print max
return 0
}
|
s058130758 | p02258 | u663227983 | 1452599572 | Python | Python3 | py | Runtime Error | 0 | 0 | 377 | n = input()
m = [0] * n
max = [0] * n
kijun = [0] * n
rieki = [0] * n
max_rieki = 0
for i in xrange(n):
m[i] = input()
for i in xrange(n-1):
max[i] = m[i+1]
kijun[i] = m[i]
for j in xrange(i+1,n):
if max[i] < m[j]:
max[i] = m[j]
rieki[i] = max[i] - kijun[i]
if i == 0:
max_rieki = rieki[0]
if riek... |
s635842127 | p02258 | u619765879 | 1452599761 | Python | Python | py | Runtime Error | 0 | 0 | 251 | def main(){
n = input()
for i in n-1:
R[i] = input()
max = R[1] - R[0]
min = R[0]
for i+1 in n-1:
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print max
}
|
s933706904 | p02258 | u619765879 | 1452599773 | Python | Python | py | Runtime Error | 0 | 0 | 251 | def main(){
n = input()
for i in n-1:
R[i] = input()
max = R[1] - R[0]
min = R[0]
for i+1 in n-1:
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print max
}
|
s997832747 | p02258 | u619765879 | 1452600061 | Python | Python | py | Runtime Error | 0 | 0 | 266 | def main(){
n = input()
R = []
for i in n-1:
R.append(input())
max = R[1] - R[0]
min = R[0]
for i+1 in n-1:
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print max
}
|
s545738017 | p02258 | u619765879 | 1452600086 | Python | Python | py | Runtime Error | 0 | 0 | 280 | def main(){
n = input()
R = []
for i in range(n-1):
R.append(input())
max = R[1] - R[0]
min = R[0]
for i+1 in range(n-1):
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print max
}
|
s375792526 | p02258 | u619765879 | 1452600091 | Python | Python | py | Runtime Error | 0 | 0 | 278 | def main(){
n = input()
R = []
for i in range(n-1):
R.append(input())
max = R[1] - R[0]
min = R[0]
for i in range(n-1):
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print max
}
|
s164988217 | p02258 | u619765879 | 1452600119 | Python | Python | py | Runtime Error | 0 | 0 | 260 | n = input()
R = []
for i in range(n-1):
R.append(input())
max = R[1] - R[0]
min = R[0]
for i+1 in range(n-1):
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print max |
s647841109 | p02258 | u619765879 | 1452600507 | Python | Python | py | Runtime Error | 0 | 0 | 256 | n = input()
R = []
for i in range(n):
R.append(input())
max = R[1] - R[0]
min = R[0]
for i+1 in range(n):
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print max |
s267731127 | p02258 | u619765879 | 1452600511 | Python | Python | py | Runtime Error | 0 | 0 | 256 | n = input()
R = []
for i in range(n):
R.append(input())
max = R[1] - R[0]
min = R[0]
for i+1 in range(n):
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print max |
s374975880 | p02258 | u619765879 | 1452600692 | Python | Python | py | Runtime Error | 0 | 0 | 258 | n = input()
R = []
for i in range(1,n):
R.append(input())
max = R[1] - R[0]
min = R[0]
for i in range(2,n):
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print max |
s845035491 | p02258 | u619765879 | 1452600719 | Python | Python | py | Runtime Error | 0 | 0 | 210 | n = input()
R = []
for i in range(1,n):
R.append(input())
max = R[1] - R[0]
min = R[0]
for i in range(2,n):
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print max |
s938837182 | p02258 | u619765879 | 1452600770 | Python | Python | py | Runtime Error | 0 | 0 | 208 | n = input()
R = []
for i in range(1,n):
R.append(input())
max = R[1] - R[0]
min = R[0]
for i in range(2,n):
if R[i]-min>max:
max = R[i] - min
if R[i]<min:
min = R[i]
print 1 |
s186022242 | p02258 | u619765879 | 1452600896 | Python | Python | py | Runtime Error | 0 | 0 | 216 | n = input()
R = []
for i in range(1,n):
R.append(input())
max = R[1] - R[0]
min = R[0]
for i in range(2,n):
if R[i] - min > max:
max = R[i] - min
if R[i] < min:
min = R[i]
print max |
s275199334 | p02258 | u177808190 | 1452603602 | Python | Python | py | Runtime Error | 0 | 0 | 192 | num = input()
l =[]
for i in range(num):
l.append(input())
max = l[1] - l[0]
for i in range(num):
for j in range(num-1):
if max < l[j] - l[i]
max = l[j] - l[i]
print max |
s171924014 | p02258 | u532962080 | 1452608105 | Python | Python | py | Runtime Error | 0 | 0 | 161 | N=int(raw_input())
max=(-1)*(10**9)
x1=input()
min=x1
for i in range(n-1):
x=int(raw_input())
if max < x-min:
max=x-min
if min>x:
min=x
print max |
s199784619 | p02258 | u177295149 | 1452610208 | Python | Python | py | Runtime Error | 0 | 0 | 175 | n = int(raw_input())
minv = R[0]
maxv = (-1)*10**9
for j in range(0, n-1):
if minv >= R[j]:
min = R[j]
if maxv <= R[i+1] - minv:
maxv = R[i+1] - minv |
s078646473 | p02258 | u177295149 | 1452610227 | Python | Python | py | Runtime Error | 0 | 0 | 176 | n = int(raw_input())
minv = R[0]
maxv = (-1)*10**9
for j in range(0, n-1):
if minv >= R[j]:
minv = R[j]
if maxv <= R[i+1] - minv:
maxv = R[i+1] - minv |
s998222100 | p02258 | u177295149 | 1452610243 | Python | Python | py | Runtime Error | 0 | 0 | 176 | n = int(raw_input())
minv = R[0]
maxv = (-1)*10**9
for j in range(2, n-1):
if minv >= R[j]:
minv = R[j]
if maxv <= R[i+1] - minv:
maxv = R[i+1] - minv |
s373302878 | p02258 | u177295149 | 1452610304 | Python | Python | py | Runtime Error | 0 | 0 | 177 | n = int(raw_input())
minv = 10**9
maxv = (-1)*10**9
for j in range(0, n-1):
if minv >= R[j]:
minv = R[j]
if maxv <= R[i+1] - minv:
maxv = R[i+1] - minv |
s123371883 | p02258 | u177295149 | 1452610396 | Python | Python | py | Runtime Error | 0 | 0 | 187 | n = int(raw_input())
minv = 10**9
maxv = (-1)*10**9
for j in range(0, n-1):
if minv >= R[j]:
minv = R[j]
if maxv <= R[i+1] - minv:
maxv = R[i+1] - minv
print max |
s945773922 | p02258 | u177295149 | 1452610402 | Python | Python | py | Runtime Error | 0 | 0 | 188 | n = int(raw_input())
minv = 10**9
maxv = (-1)*10**9
for j in range(0, n-1):
if minv >= R[j]:
minv = R[j]
if maxv <= R[i+1] - minv:
maxv = R[i+1] - minv
print maxv |
s105911189 | p02258 | u177295149 | 1452610451 | Python | Python | py | Runtime Error | 0 | 0 | 188 | n = int(raw_input())
minv = 10**9
maxv = (-1)*10**9
for j in range(0, n-1):
if minv >= R[j]:
minv = R[j]
if maxv <= R[j+1] - minv:
maxv = R[j+1] - minv
print maxv |
s923781317 | p02258 | u177295149 | 1452610513 | Python | Python | py | Runtime Error | 0 | 0 | 195 | n = int(raw_input())
minv = 10**9
R[0] = 0
maxv = (-1)*10**9
for j in range(0, n-1):
if minv >= R[j]:
minv = R[j]
if maxv <= R[j+1] - minv:
maxv = R[j+1] - minv
print maxv |
s095652703 | p02258 | u177295149 | 1452610569 | Python | Python | py | Runtime Error | 0 | 0 | 192 | n = int(raw_input())
minv = 10**9
R[0] = 0
maxv = (-1)*10**9
for j in range(n-1):
if minv >= R[j]:
minv = R[j]
if maxv <= R[j+1] - minv:
maxv = R[j+1] - minv
print maxv |
s692170608 | p02258 | u682357930 | 1452610627 | Python | Python3 | py | Runtime Error | 0 | 0 | 214 | n = input()
a = []
a = [input() for i in range(n)]
i = 0
j = 1
max = a[j] - a[i]
while n > i:
j = i+1
while n > j:
if max < a[j] - a[i]:
max = a[j] - a[j]
j += 1
i += 1
print '{0}',format(max) |
s067511345 | p02258 | u682357930 | 1452611607 | Python | Python | py | Runtime Error | 0 | 0 | 159 | n = input()
a0 = input()
a1 = input()
maxv = a1 - a0
minv = a0
for j in range(n-1):
v = input()
maxv = max(maxv, v-minv)
minv = min(v, minv)
print maxv |
s102889487 | p02258 | u682357930 | 1452611716 | Python | Python | py | Runtime Error | 0 | 0 | 161 | n = input()
a0 = input()
a1 = input()
maxv = a1 - a0
minv = a0
for j in range(1:n-1):
v = input()
maxv = max(maxv, v-minv)
minv = min(v, minv)
print maxv |
s342876940 | p02258 | u682357930 | 1452611783 | Python | Python | py | Runtime Error | 0 | 0 | 143 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.