|
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 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 |
#include <iostream> #include <algorithm> #include <queue> #include <vector> #include <cstdlib> #include <cstdio> #include <string> #include <cstring> #include <ctime> #include <iomanip> #include <cmath> #include <set> #include <stack> #include <cmath> using namespace std; long long board[2005][2005]; long long sum[2005][2005]; long long dl[4005],dr[4005]; int main(){ int n = 0; scanf(" %d",&n); memset(sum, 0, sizeof(sum)); memset(board, 0, sizeof(board)); memset(dl, 0, sizeof(dl)); memset(dr, 0, sizeof(dr)); for (int i = 1; i <= n; i++) { for (int j = 1;j <= n; j++) { scanf(" %lld",&board[i][j]); dl[i+j] += board[i][j]; dr[i-j+n] += board[i][j]; } } //update sum for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { sum[i][j] = dl[i+j] + dr[i-j+n] - board[i][j]; } } int x1 = 1,y1 = 1,x2 = 2,y2 = 1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if ((i+j)%2) { //grp1 if (sum[i][j] > sum[y2][x2]) { y2 = i,x2 = j; } }else{ //grp2 if (sum[i][j] > sum[y1][x1]) { y1 = i,x1 = j; } } } } printf("%lldn%d %d %d %dn",sum[y1][x1]+sum[y2][x2],y1,x1,y2,x2); return 0; } |
最后还是没有了尊严，去看题解了。。。
http://blog.csdn.net/kenden23/article/details/38959141
这个题告诉我们了关于交叉坐标和对角线的性质，要想很好地做过需要很多优美的姿势-_-#。
