import sys gears = list(map(int, sys.stdin.readline().split())) pre = gears[0] order = 'mixed' for i in range(1, len(gears)): if pre >= gears[i]: break pre = gears[i] else: order = 'ascending' for i in range(1, len(gears)): if pre

for start, end in query: print('{:.2f}'.format(sum(scores[start - 1: end])/(end - start + 1)))

import sys N = int(sys.stdin.readline()) stones = list(map(int, sys.stdin.readline().split())) mx = [float('-inf')] dp = [1]*N for i in range(N): for j in range(i + 1, N): if stones[i] < stones[j]: dp[j] = max(dp[i] + 1, dp[j]) print(max(dp))

import sys N = int(sys.stdin.readline()) grid = [[0]*2 for _ in range(N)] tran = [[0]*2 for _ in range(N)] for i in range(N - 1): A, B, AB, BA = map(int, sys.stdin.readline().split()) grid[i][0] = A grid[i][1] = B tran[i][0] = AB tran[i][1] = BA AN, BN = map(int, sys.stdin.readline().split()) grid[-1][0] = AN grid[-1][1] = BN for i in range(N - 1): grid[i + 1][0] += min(grid[i][0], grid[i][1] + ..

import sys K, P, N = map(int, sys.stdin.readline().split()) for _ in range(N): K = K*P%1000000007 print(K%1000000007)

* items의 value가 높은것 부터 채워 넣어야 함 * 같은 value는 합침 * 합치고 sort하면 sort 시간이 감소함 * 혹은 최대 value 개수의 table을 만들고 value에 각 weight들을 합(이것 자체를 sorted array로 사용) W, N = 100, 2 # capacity, num items items = [ [90, 1], # weight, value [70, 2] ] weight_sums = collections.defaultdict(int) for w, v in items: weight_sums[v] += w weight_sums = sorted(weight_sums.items(), key=lambda p: p[0], reverse=True) tot = 0 for ..