fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. long long a[1005][1005], s[1005][1005];
  4.  
  5. int main() {
  6. int m, n, k;
  7. cin >> m >> n >> k;
  8.  
  9. for (int i = 1; i <= m; i++)
  10. for (int j = 1; j <= n; j++) {
  11. cin >> a[i][j];
  12. s[i][j] = a[i][j] + s[i-1][j] + s[i][j-1] - s[i-1][j-1];
  13. }
  14.  
  15. long long ans = -1e18;
  16.  
  17. for (int i = k; i <= m; i++)
  18. for (int j = k; j <= n; j++) {
  19. long long tong = s[i][j] - s[i-k][j] - s[i][j-k] + s[i-k][j-k];
  20. if (k > 2)
  21. tong -= s[i-1][j-1] - s[i-k+1][j-1] - s[i-1][j-k+1] + s[i-k+1][j-k+1];
  22. ans = max(ans, tong);
  23. }
  24.  
  25. cout << ans;
  26. }
  27.  
Success #stdin #stdout 0.01s 5328KB
stdin
Standard input is empty
stdout
-1000000000000000000