Matrix
Description
Given an n*nmatrix A, whose entries Ai,j are integer numbers ( 0 <= i < n, 0 <= j< n ). An operation SHIFT at row i ( 0 <= i < n ) will move theintegers in the row one position right, and the rightmost integer will wraparound to the leftmost column.
You can do the SHIFT operation at arbitrary row, and as many times as you like.Your task is to minimize
max0<=j<n{Cj|Cj=Σ0<=i< nAi,j}
Input
The input consistsof several test cases. The first line of each test case contains an integer n.Each of the following n lines contains n integers, indicating the matrix
最低0.47元/天 解锁文章
1830
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
