# data = []
#
# for i in range(10):
# v = []
# for j in range(10):
# v.append(0)
# data.append(v)
#
# data[5][5] = 5
#
# for i in range(10):
# for j in range(10):
# print(data[i][j], end=' ')
# print()
# def solve(m, n, x, y):
# data = []
# a = 0
# b = []
# c = 0
# d = 0
# m = int(m)
# n = int(n)
# x = int(x)
# y = int(y)
# for i in range(n):
# v = input().split()
# for j in range(len(v)):
# v[j] = int(v[j])
# data.append(v)
# for i in range(n - (y - 1)):
# for j in range(m - (x - 1)):
# a = 0
# for c in range(y):
# for d in range(x):
# a += data[i + c][j + d]
# b.append(a)
# b.sort()
# b.reverse()
# return b[0]
#
# m, n, x, y = input().split()
# print(solve(m, n, x, y))
class mine:
def __init__(self, m, n, x, y):
self.a = 0
self.c = 0
self.d = 0
self.m = int(m)
self.n = int(n)
self.x = int(x)
self.y = int(y)
self.data = []
self.b = []
self.input()
self.output()
def input(self):
for i in range(self.n):
v = input().split()
for j in range(len(v)):
v[j] = int(v[j])
self.data.append(v)
def output(self):
for i in range(self.n - (self.y - 1)):
for j in range(self.m - (self.x - 1)):
self.a = 0
for self.c in range(self.y):
for self.d in range(self.x):
self.a += self.data[i + self.c][j + self.d]
self.b.append(self.a)
self.b.sort()
self.b.reverse()
print(self.b[0])
m, n, x, y = input().split()
v = mine(m, n, x, y)
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
220515
220515
댓글 0개
좋아요
댓글(0)
bottom of page