Last active
January 4, 2016 02:09
-
-
Save flutesa/8553524 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def isAnswer(left_border, sum, mid): | |
flint = sum[mid] - sum[left_border-1] | |
bengann = (sum[len(sum)-1] - sum[0]) - flint | |
#print(left_border, mid, flint >= bengann, flint-bengann) # с этой функцией всё ок | |
return flint >= bengann | |
def find(left_border, sum): | |
l = left_border #ок | |
r = len(sum)-1 #ок | |
while l + 1 < r: | |
m = (l + r)//2 | |
if isAnswer(left_border, sum, m): | |
#print("hi!") | |
r = m | |
else: | |
l = m | |
return r, isAnswer(left_border, sum, r) | |
f = open('treasure.in', 'r') | |
n = int(f.readline()) | |
t1, t2 = list(map(int, f.readline().split(" "))) | |
a, b, c, d = list(map(int, f.readline().split(" "))) | |
f.close() | |
#вычисление стоимости сокровищ | |
costs = list() | |
costs.append(0) | |
costs.append(t1) | |
costs.append(t2) | |
for i in range(3, n+1): | |
costs.append((a*costs[i-2] + b*costs[i-1] + c) % d) | |
#сумма на префиксах | |
sum = list() | |
sum.append(0) | |
for i in range(1, n + 1): | |
sum.append(sum[i - 1] + costs[i]) | |
#сумма на отрезке с [l, r] = sum[r] - sum[l - 1] | |
#сумма ценности всех сокровищ, для быстрого нахождения суммы для Бен Ганна | |
#summ = sum[len(sum)-1] - sum[0] | |
#summ = sum[n] - sum[0] | |
ans_i = 0 | |
ans_j = 0 | |
min = n + 1 | |
flag = True | |
i = 1 | |
while flag and i < n+1: | |
j, flag = find(i, sum) #находим правую границу, такую, что сумма подходит | |
if j - i < min and flag: | |
min = j - i | |
ans_i, ans_j = i, j | |
i += 1 | |
print(ans_i, ans_j) | |
#for i in range(1, n): | |
# j = find(i, sum) | |
# | |
# #flint = sum[j] - sum[i-1] | |
# #bengann = (sum[len(sum)-1] - sum[0]) - flint | |
# | |
# #print(i, j, flint, bengann) | |
# | |
# if j - i < min: | |
# #if j - i < min and flint >= bengann: | |
# min = j - i | |
# ans_i, ans_j = i, j | |
#print(ans_i, ans_j) | |
f = open('treasure.out', 'w') | |
print(str(ans_i) + " " + str(ans_j), file=f) | |
f.close() | |
#решение за O(nlogn) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment