def brute_force(h):
ret = 0
N = len(h)
for left in range(N):
minHeight = h[left]
for right in range(left, N):
minHeight = min(minHeight, h[right])
ret = max(minHeight*(right-left+1), ret)
return ret
print(brute_force([7,1,5,9,6,7,3]))
print(brute_force([1,4,4,4,4,1,1]))
def divide_conquer(h):
def solve(left, right):
if left == right: return h[left]
# 이 둘이 중요.
mid = (left + right) // 2 # divide
ret = max(solve(left, mid), solve(mid+1, right)) # divide and conquer
lo , hi = mid, mid+1 # 중앙에 걸치는 녀석들을 잡기 위해
height = min(h[lo], h[hi]) # 중앙에서 낮은 판자높이를 구함. (초기값)
ret = max(ret, height*2) # [mid,mid+1]만 포함하는 너비 2인 사각형 고려
# 후처리작업 병합정렬처럼 반으로 잘라서 각개격파를 했지만
# 병합정렬과는 다르지만 부족한 면을 반복문으로 메꾸는 것.
# 사각형이 입력 전체를 덮을 때까지 확장한다.
while (left < lo or hi < right):
# 더 높은 판자를 향해 확장한다. (낮은 판자로 가면 최대값을 구할 수 없다.)
if (hi < right and (lo == left or h[lo-1] < h[hi+1])):
hi += 1
height = min(height, h[hi])
else:
lo -= 1
height = min(height, h[lo])
ret = max(ret, height*(hi-lo+1))
return ret
return solve(0, len(h)-1)
print('divide_conquer')
print(divide_conquer([7,1,5,9,6,7,3]))
print(divide_conquer([1,4,4,4,4,1,1]))
n, k = tuple(map(int, input().strip().split(' ')))
c = tuple(map(int, input().strip().split(' ')))
result = 100
tmp = 0
while True:
tmp = (tmp + k) % n
result -= (1 + c[tmp]*2)
if tmp == 0:
break
print(result)
n = int(input())
n_list = list(map(int, input().strip().split(' ')))
p = { n_list[n_list[x-1]-1]:x for x in n_list}
for i in range(1, n+1):
print(p[i])
from collections import deque
n, k, q = map(int, input().strip().split(' '))
m = deque(map(int, input().strip().split(' '))) # integers
m.rotate(k) # wow...
for m_i in range(q):
print(m[int(input())]) # don't need strip(). int() will do this.
n, k, q = map(int, input().strip().split(' '))
m = list(map(int, input().strip().split(' ')))
k %= n; tmp = m[-k:]; del m[-k:]; m[0:0] = tmp
for m_i in range(q):
print(m[int(input())]) # don't need strip(). int() will do this.
public class RegistrationForm implements Cloneable {
private String name = "Zed";
private String email = "zzzed@gmail.com";
private Date dateOfBirth = new Date(1990, 1, 28);
private int weight = 60;
private Gender gender = Gender.MALE;
private Status status = Status.SINGLE;
private List children = Arrays.asList(new Child(Gender.FEMALE));
private double monthSalary = 1000;
private List favouriteBrands = Arrays.asList("Adidas", "GAP");
@Override
protected RegistrationForm clone() throws CloneNotSupportedException {
RegistrationFrom prototyped = new RegistrationForm();
prototyped.name = name;
prototyped.email = email;
prototyped.dateOfBirth = (Date)dateOfBirth.clone();
prototyped.weight = weight;
prototyped.gender = gender
prototyped.status = status;
List childrenCopy = new ArrayList();
for (Child c : children) {
childrenCopy.add(c.clone());
}
prototyped.children = childrenCopy;
prototyped.monthsCopy = monthSalary;
List brandsCopy = new ArrayList();
for (String s : favoriteBrands) {
brandsCopy.add(s);
}
prototyped.favouriteBrands = brandsCopy;
return prototyped;
}
}
사용자를 만들 때마다, clone()을 호출해서 기본값으로 쓴다.(def registration-prototype
{:name "Zed"
:email "zzzed@gmail.com"
:date-of-birth "1970-01-01"
:weight 60
:gender :male
:status :single
:children [{:gender :female}]
:month-solary 1000
:brands ["Adidas" "GAP"]})
;;return new object
(assoc registration-prototype
:name "WHO"
:email "EMAIL@DOTCOM"
:weight 52
:gender :female
:month-salary 0)
clojure는 기본적으로 불변객체이기 때문에 clone은 필요없다. #!/bin/python3
def saveThePrisoner(n, m, s):
res = (m + s - 1) % n
if res == 0:
res = n
return res
t = int(input().strip())
for _ in range(t):
n, m, s = [int(x) for x in input().strip().split(' ')]
result = saveThePrisoner(n, m, s)
print(result)
def viral_ad(n):
tmp = 2
res = 2
while n > 1:
tmp = (tmp * 3) // 2
res += tmp
n -= 1
return res
n = int(input().strip())
result = viral_ad(n)
print(result)
i,j,k = [int(x) for x in input().strip().split(' ')]
cnt = 0
for n in range(i,j):
diff = abs(n - int(str(n)[::-1])) % k
if diff == 0:
cnt += 1
print(cnt)
def bueatiful_days2():
i,j,k = [int(x) for x in input().strip().split(' ')]
res = sum(1 for x in range(i,j) if abs(int(str(x)[::-1])-x) % k == 0)
print(res)
from functools import reduce
t = int(input().strip())
for _ in range(t):
n = int(input().strip())
print(reduce(lambda a,b: a+b, (map(lambda x: pow(2,x), range(((n+1)//2)+1)))) - n%2)
ex) n = 4 111 -> range(((4+1)// 2)+1) -> range(2+1) -> 1 2 3저절로 1 2 3 이라고 나와주니 더 고맙다. 바로 pow를 이용해서 값을 구하자
[pow(2,1), pow(2,2), pow(2,3)]그리고 다 더한다. reduce로
reduce(lambda a,b: a+b, [pow(2,1), pow(2,2), pow(2,3)])그리고 even odd에 따른 차이를 뒤에 붙여준다.
- n%2
#!/bin/python3
import string
from functools import reduce
h = {key: int(value) for key, value in zip(string.ascii_lowercase, input().strip().split(' '))}
word = input().strip()
height = reduce(max, map(lambda x: h[x], word))
print(len(word)*height)
참고자료: 딕셔너리로 한꺼번에 가져오기 위한 자료.#!/bin/python3
n, k = [int(x) for x in input().strip().split(' ')]
height = [int(x) for x in input().strip().split(' ')]
print((lambda x: x if x > 0 else 0)(max(height)-k))
음... 나쁘지 않은듯. 결국 인풋을 받는 내용을 빼고는 한줄로 끝낸 거니까... 근대 이게 효율적인건가?