Kalila and Dimna in the Logging Industry (Codeforces 320E)
Tags: DP, dp

Kalila and Dimna are two jackals living in a huge jungle. One day they decided to join a logging factory in order to make money. The manager of logging factory wants them to go to the jungle and cut n trees with heights a1, a2, ..., an. They bought a chain saw from a shop. Each time they use the chain saw on the tree number i, they can decrease the height of this tree by one unit. Each time that Kalila and Dimna use the chain saw, they need to recharge it. Cost of charging depends on the id of the trees which have been cut completely (a tree is cut completely if its height equal to 0). If the maximum id of a tree which has been cut completely is i (the tree that have height ai in the beginning), then the cost of charging the chain saw would be bi. If no tree is cut completely, Kalila and Dimna cannot charge the chain saw. The chainsaw is charged in the beginning. We know that for each i < j, ai < aj and bi > bj and also bn = 0 and a1 = 1. Kalila and Dimna want to cut all the trees completely, with minimum cost. They want you to help them! Will you?

Input: The first line of input contains an integer n (1 ≤ n ≤ 105). The second line of input contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109). The third line of input contains n integers b1, b2, ..., bn (0 ≤ bi ≤ 109).It's guaranteed that a1 = 1, bn = 0, a1 < a2 < ... < an and b1 > b2 > ... > bn.

Output: The only line of output must contain the minimum cost of cutting all the trees completely.Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.


Sample Inputs:
5
1 2 3 4 5
5 4 3 2 0

6
1 2 3 10 20 30
6 5 4 3 2 0

Sample Outputs:
25

138

Solution (Python):
P = 1000000007
MAX_N = 111111

def cost(x, y):
    return b[x] * a[y]
n = int(input())
a = [0] + list(map(int, input().split()))
a.append(a[n] + 1)
b = [0] + list(map(int, input().split()))
dp = [0] * MAX_N
st = [0] * MAX_N
de = [0] * MAX_N
now = tail = 1
st[now] = 0
de[1] = 1
for i in range(2, n + 1):
    if st[now + 1] == i:
        now += 1
    dp[i] = dp[de[now]] + cost(de[now], i)
    while i < st[tail] and dp[i] + cost(i, st[tail]) <= dp[de[tail]] + cost(de[tail], st[tail]):
        tail -= 1
    l = max(i + 1, st[tail])
    r = n + 1
    mid = (l + r) // 2
    while l < r:
        if dp[i] + cost(i, mid) <= dp[de[tail]] + cost(de[tail], mid):
            r = mid
        else:
            l = mid + 1
        mid = (l + r) // 2
    tail += 1
    st[tail] = mid
    de[tail] = i
print(dp[n])

Solution (Python):
P = 1000000007
MAX_N = 111111

def cost(x, y):
    return b[x] * a[y]
n = int(input())
a = [0] + list(map(int, input().split()))
a.append(a[n] + 1)
b = [0] + list(map(int, input().split()))
dp = [0] * MAX_N
st = [0] * MAX_N
de = [0] * MAX_N
now = tail = 1
st[now] = 0
de[1] = 1
for i in range(2, n + 1):
    if st[now + 1] == i:
        now += 1
    dp[i] = dp[de[now]] + cost(de[now], i)
    while i < st[tail] and dp[i] + cost(i, st[tail]) <= dp[de[tail]] + cost(de[tail], st[tail]):
        tail -= 1
    l = max(i + 1, st[tail])
    r = n + 1
    mid = (l + r) // 2
    while l < r:
        if dp[i] + cost(i, mid) <= dp[de[tail]] + cost(de[tail], mid):
            r = mid
        else:
            l = mid + 1
        mid = (l + r) // 2
    tail += 1
    st[tail] = mid
    de[tail] = i
print(dp[n])

Solution (Python):
P = 1000000007
MAX_N = 111111

def cost(x, y):
    return b[x] * a[y]
n = int(input())
a = [0] + list(map(int, input().split()))
a.append(a[n] + 1)
b = [0] + list(map(int, input().split()))
dp = [0] * MAX_N
st = [0] * MAX_N
de = [0] * MAX_N
now = tail = 1
st[now] = 0
de[1] = 1
for i in range(2, n + 1):
    if st[now + 1] == i:
        now += 1
    dp[i] = dp[de[now]] + cost(de[now], i)
    while i < st[tail] and dp[i] + cost(i, st[tail]) <= dp[de[tail]] + cost(de[tail], st[tail]):
        tail -= 1
    l = max(i + 1, st[tail])
    r = n + 1
    mid = (l + r) // 2
    while l < r:
        if dp[i] + cost(i, mid) <= dp[de[tail]] + cost(de[tail], mid):
            r = mid
        else:
            l = mid + 1
        mid = (l + r) // 2
    tail += 1
    st[tail] = mid
    de[tail] = i
print(dp[n])