File size: 971 Bytes
bda86ee
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
import numpy as np

def maximum_path_each(path, value, t_x, t_y, max_neg_val):
    for y in range(t_y):
        for x in range(max(0, t_x + y - t_y), min(t_x, y + 1)):
            if x == y:
                v_cur = max_neg_val
            else:
                v_cur = value[x, y - 1]
            
            if x == 0:
                if y == 0:
                    v_prev = 0.
                else:
                    v_prev = max_neg_val
            else:
                v_prev = value[x - 1, y - 1]
            
            value[x, y] = max(v_cur, v_prev) + value[x, y]
    
    index = t_x - 1
    for y in range(t_y - 1, -1, -1):
        path[index, y] = 1
        if index != 0 and (index == y or value[index, y - 1] < value[index - 1, y - 1]):
            index -= 1

def maximum_path_c(paths, values, t_xs, t_ys, max_neg_val=-1e9):
    b = values.shape[0]
    for i in range(b):
        maximum_path_each(paths[i], values[i], t_xs[i], t_ys[i], max_neg_val)