-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTask_B.py
More file actions
61 lines (59 loc) · 1.4 KB
/
Task_B.py
File metadata and controls
61 lines (59 loc) · 1.4 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
def find_next_min(start, r):
n = 0
for i in range(start, len(r)-1):
if r[i] > r[i+1]:
n += 1
elif r[i] <= r[i + 1]:
return(n)
def calc(N,r):
bonus_sum = 0
for i in range(N):
if i==0:
w = 1
#cur_bonus = 500
w += find_next_min(i, r)
cur_bonus = w * 500
elif i==N-1:
if r[i-1] < r[i]:
cur_bonus = cur_bonus + 500
elif r[i-1] >= r[i]:
cur_bonus = 500
else:
if r[i-1] < r[i]:
cur_bonus = cur_bonus + 500
tmp_bonus = 500
for j in range(i,N-1):
if r[j]>r[j+1]:
tmp_bonus = tmp_bonus + 500
elif r[j]<=r[j+1]:
break
if cur_bonus < tmp_bonus:
cur_bonus = tmp_bonus
elif r[i-1] > r[i]:
cur_bonus = cur_bonus - 500
tmp_bonus = 500
for j in range(i,N-1):
if r[j]>r[j+1]:
tmp_bonus = tmp_bonus + 500
elif r[j]<=r[j+1]:
break
if cur_bonus > tmp_bonus:
cur_bonus = tmp_bonus
elif r[i-1]==r[i]:
cur_bonus = 500
for j in range(i,N-1):
if r[j]>r[j+1]:
cur_bonus = cur_bonus + 500
elif r[j]<=r[j+1]:
break
bonus_sum = bonus_sum + cur_bonus
#print(str(cur_bonus) + ' ' + str(r[i]) + ' ' + str(bonus_sum))
return(bonus_sum)
if __name__ == '__main__':
#print('Enter drivers number')
N=int(input())
r=[]
for i in range(N):
#print('enter a rating of driver ' + str(i+1))
r.append(int(input()))
print(calc(N,r))