The Lazy Cow (Silver)
실버 II의견: 0
It's a hot summer day, and Bessie the cow is feeling quite lazy. She wants to locate herself at a position in her field so that she can reach as much delicious grass as possible within only a short distance.
The field Bessie inhabits is described by an N by N grid of square cells (1 <= N <= 400). The cell in row r and column c (1 <= r,c <= N) contains G(r,c) units of grass (0 <= G(r,c) <= 1000). From her initial square in the grid, Bessie is only willing to take up to K steps (0 <= K <= 2*N). Each step she takes moves her to a cell that is directly north, south, east, or west of her current location.
Please help Bessie determine the maximum amount of grass she can reach, if she chooses the best possible initial location in the grid.
Line 1: The integers N and K.
Lines 2..1+N: Line r+1 contains N integers describing row r of the grid.
The maximum amount of grass Bessie can reach, if she chooses the best possible initial location (the location from which she can reach the most grass).
lazy.inlazy.out5 2
50 5 25 6 17
14 3 2 7 21
99 10 1 2 80
8 7 5 23 11
10 0 78 1 9342Output details: Bessie can reach 342 total units of grass if she locates herself in the middle of the grid.
평가 및 의견
The Lazy Cow (Silver)
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
The Lazy Cow (Silver)