[编程题] 最大和

在一个N*N的数组中寻找所有横，竖，左上到右下，右上到左下，四种方向的直线连续D个数字的和里面最大的值 

输入描述:

每个测试输入包含1个测试用例，第一行包括两个整数 N 和 D :
3 <= N <= 100
1 <= D <= N
接下来有N行，每行N个数字d:
0 <= d <= 100

输出描述:

输出一个整数，表示找到的和的最大值

输入例子:

4 2
87 98 79 61
10 27 95 70
20 64 73 29
71 65 15 0

输出例子:

193

答案：

line1 = raw_input()


N = int(line1.split()[0])
D = int(line1.split()[1])
#print(N,D)
mat = []
for i in range(N):
    lineee = raw_input()
    a = map(lambda x:int(x),lineee.split())
    #print (a) 
    mat.append(a)
#print(mat)

max = 0

for i in range(N-D+1):
    for j in range(N-D+1):
        sum = 0
        for count in range(D):
            sum += mat[i+count][j+count]
            #print(sum)
        if sum > max:
            max = sum

for i in range(N-D+1):
    for j in range(N):
        sum = 0
        for count in range(D):
            sum += mat[i+count][j]
            #print(sum)
        if sum > max:
            max = sum

for i in range(N):
    for j in range(N-D+1):
        sum = 0
        for count in range(D):
            sum += mat[i][j+count]
            #print(sum)
        if sum > max:
            max = sum

for i in range(N-D+1):
    for j in range(N-1,D-2,-1):
        sum = 0
        for count in range(D):
            sum += mat[i+count][j-count]
            #print(sum)
        if sum > max:
            max = sum
                
print (max)