fork download
copy 
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<stack>
  14. #include<set>
  15. //#include<map>
  16. using namespace std;
  17. //Macro
  18. #define rep(i,a,b)  for(int i=a,tt=b;i<=tt;++i)
  19. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  20. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  21. #define irep(i,x)   for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  22. #define read()  (strtol(ipos,&ipos,10))
  23. #define sqr(x)  ((x)*(x))
  24. #define pb  push_back
  25. #define PS  system("pause");
  26. typedef long long   ll;
  27. typedef pair<int,int> pii;
  28. const int oo=~0U>>1;
  29. const double inf=1e100;
  30. const double eps=1e-6;
  31. string name="", in=".in", out=".out";
  32. //Var
  33. int n,m,k;
  34. int map[1508][1508];
  35. int s[1508][1508];
  36. int f[1508][1508][4],gx[1508][1508][3],gy[1508][1508][3];
  37. void Init()
  38. {
  39.     scanf("%d%d%d",&n,&m,&k);
  40.     rep(i,1,n)rep(j,1,m)scanf("%d",&map[i][j]);
  41.     rep(i,1,n)rep(j,1,m)map[i][j]+=map[i][j-1];
  42.     rep(i,1,n)rep(j,1,m)map[i][j]+=map[i-1][j];
  43.     rep(i,k,n)rep(j,k,m)s[i][j]=map[i][j]-map[i][j-k]-map[i-k][j]+map[i-k][j-k];
  44. }
  45. void Work()
  46. {
  47.     rep(i,k,n)rep(j,k,m)
  48.     {
  49.         f[i][j][1]=max(max(f[i-1][j][1],f[i][j-1][1]),s[i][j]);
  50.  
  51.         f[i][j][2]=max(f[i-1][j][2],f[i][j-1][2]);
  52.         f[i][j][2]=max(f[i][j][2],max(f[i-k][j][1],f[i][j-k][1])+s[i][j]);
  53.         f[i][j][2]=max(f[i][j][2],max(f[i-k][j][1]+gx[i][j-1][1],f[i][j-k][1]+gy[i-1][j][1]));
  54.  
  55.         f[i][j][3]=max(f[i-1][j][3],f[i][j-1][3]);
  56.         f[i][j][3]=max(f[i][j][3],max(f[i-k][j][2],f[i][j-k][2])+s[i][j]);
  57.         f[i][j][3]=max(f[i][j][3],max(f[i-k][j][1]+gx[i][j-k][1],f[i][j-k][1]+gy[i-k][j][1])+s[i][j]);
  58.         f[i][j][3]=max(f[i][j][3],max(f[i-k][j][1]+gx[i][j-1][2],f[i][j-k][1]+gy[i-1][j][2]));
  59.         f[i][j][3]=max(f[i][j][3],max(f[i-k][j][2]+gx[i][j-1][1],f[i][j-k][2]+gy[i-1][j][1]));
  60.  
  61.         gx[i][j][1]=max(gx[i][j-1][1],s[i][j]);
  62.         gx[i][j][2]=max(gx[i][j-1][2],gx[i][j-k][1]+s[i][j]);
  63.         gy[i][j][1]=max(gy[i-1][j][1],s[i][j]);
  64.         gy[i][j][2]=max(gy[i-1][j][2],gy[i-k][j][1]+s[i][j]);
  65.     }
  66.     printf("%d\n",f[n][m][3]);
  67. }
  68. int main()
  69. {
  70. //  freopen((name+in).c_str(),"r",stdin);
  71. //  freopen((name+out).c_str(),"w",stdout);
  72.     Init();
  73.     Work();
  74.     return 0;
  75. }
Not running #stdin #stdout 0s 0KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/YH5vn
language:
C++ (gcc 8.3)
created:
12 years 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!