fork download
copy 
  1. /*
  2. ⠀
  3.  
  4. /**
  5.  *    author:  Phatsbell
  6.  *    vnoi: https://o...content-available-to-author-only...i.info/user/ChiPhatNguyen
  7. **/
  8.  
  9.  
  10. #include <bits/stdc++.h>
  11. using namespace std;
  12. #define int long long
  13. #define pb push_back
  14. #define fi first
  15. #define se second
  16. #define all(v) (v).begin(), (v).end()
  17. #define rall(v) (v).rbegin(), (v).rend()
  18. #define sz(x) (int)(x).size()
  19. #define pii pair<int,int>
  20. const int INF = 1e18;
  21. const int MOD = 1e9+7;
  22. void fastIO(){
  23.     ios::sync_with_stdio(0);
  24.     cin.tie(0);
  25. }
  26. const int MAXN = 1005;
  27. int a[MAXN][MAXN], pref[MAXN][MAXN];
  28. main(){
  29.     fastIO();
  30.     int n, k;
  31.     cin >> n >> k;
  32.     for (int i = 1;i<=n;i++){
  33.         for (int j = 1;j<=n;j++){
  34.             cin >> a[i][j];
  35.         }
  36.     }
  37.     for (int i = 1;i<=n;i++){
  38.         for (int j = 1; j <= n; j++){
  39.             pref[i][j] = a[i][j] + pref[i-1][j] + pref[i][j-1] - pref[i-1][j-1];
  40.         }
  41.     }
  42.     int ans = -INF;
  43.     for (int i = k; i <= n; i++){
  44.         for (int j = k; j <= n; j++){
  45.             int sum = pref[i][j] - pref[i-k][j] - pref[i][j-k] + pref[i-k][j-k];
  46.             ans = max(ans, sum);
  47.         }
  48.     }
  49.     cout<<ans<<"\n";
  50.     return 0;
  51. }
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
-1000000000000000000
https://ideone.com/Uk2x7G
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!