Advertisement
Guest User

Untitled

a guest
Apr 19th, 2019
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.03 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int dp[1005][1005];
  4. int main()
  5. {
  6. int t,m,i,j,n,w;
  7. scanf("%d",&t);
  8. for(w=1;w<=t;w++)
  9. {
  10. scanf("%d",&n);
  11. for(i=1;i<=n;i++)
  12. {
  13. for(j=1;j<=n;j++)
  14. {
  15. int nr;
  16. scanf("%d",&nr);
  17. dp[i][j]=dp[i-1][j]+nr;
  18. }
  19. }
  20. int summax=-1000000;
  21. for(i=1;i<=n;i++)
  22. for(j=i;j<=n;j++)
  23. {
  24. int sum[1005];
  25. sum[0]=0;
  26. for(t=1;t<=n;t++)
  27. sum[t]=sum[t-1]+dp[j][t]-dp[i-1][t];
  28. summax=max(summax,sum[1]);
  29. int sum1=sum[1];
  30. for(t=2;t<=n;t++)
  31. {
  32. summax=max(summax,sum1);
  33. if(sum1<=0)
  34. {
  35. sum1=sum[t];
  36. summax=max(summax,sum1);
  37. }
  38. else
  39. {
  40. sum1+=sum[t];
  41. summax=max(summax,sum1);
  42. }
  43. }
  44. }
  45. printf("%d\n",summax);
  46. }
  47. return 0;
  48. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement