POJ-1050 To the Max~~~~~~~~

#include<iostream>using namespace std;int N;int arr[105][105];int main(){cin >> N;int tmp;int max = -20000;for (int j,i = 0; i < N; i++){tmp = 0;for (j = 0; j < N; j++){cin >> arr[i][j];if (tmp > 0) tmp += arr[i][j];else tmp = arr[i][j];if (tmp > max) max = tmp;}}for (int i = 0; i < N -1; i++){for (int j = i+1; j < N; j++){tmp = 0;for (int k = 0; k < N; k++){arr[i][k] += arr[j][k];if (tmp > 0) tmp += arr[i][k];else tmp = arr[i][k];if (tmp > max) max = tmp;}}}cout << max << endl;system("PAUSE");return 0;}