num_cases = int(f_in.readline())
other_data = None
return num_cases, other_data
def process_case(f_in, f_out, case_no, other_data=None):
N = int(f_in.readline())
counts = toks_line(f_in)
e1, e2 = solve(counts)
print("Case #{}: {} {}".format(case_no, e1, e2), file=f_out)
def solve(counts):
min_rate = 0
eaten = 0
ns = counts[0]
for ns2 in counts[1:]:
if ns2 < ns:
delta = ns - ns2
eaten += delta
if delta > min_rate:
min_rate = delta
ns = ns2
eaten2 = 0
for c in counts[:-1]:
eaten2 += min(c, min_rate)
return eaten, eaten2
if __name__ == '__main__':
codejam_io.process_input(process_case, process_first, __file__)
PKD0�D��C#FF
��codejam_io.pyPK\Y�F�9iH�� ��qmushroom.pyPKt�
# import itertools as it
# import numpy as np # See http://www.numpy.org
# import sympy as sp # See http://sympy.org/en/index.html
# import gmpy2 # See https://code.google.com/p/gmpy/
# import networkx as nx # See http://networkx.github.io/
import os
import sys
# MY MODULES - available at https://github.com/lackofcheese/CodeJamLib/
sys.path.append(os.path.join(
os.environ['GOOGLE_DRIVE'], 'Coding', 'GCJ', 'CodeJamLib'))
import codejam_io
def toks_line(f_in, fun=int):
return [fun(k) for k in f_in.readline().split()]
def process_first(f_in):
num_cases = int(f_in.readline())
other_data = None
return num_cases, other_data
def process_case(f_in, f_out, case_no, other_data=None):
ans = solve()
print("Case #{}: {}".format(case_no, ans), file=f_out)
def solve():
return "FAIL"
if __name__ == '__main__':
codejam_io.process_input(process_case, process_first, __file__)
