Guest User

Untitled

a guest
Jun 17th, 2015
412
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.99 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <iostream>
  3. #include <vector>
  4. #include <algorithm>
  5. using namespace std;
  6.  
  7. #define task "a"
  8.  
  9. typedef long long ll;
  10. typedef pair<ll, pair<int, int> > tt;
  11. const int maxN = 1 << 10;
  12. const ll LINF = (ll)1e18;
  13.  
  14. ll S[maxN][maxN];
  15. tt B[maxN][maxN];
  16.  
  17. #define fi first
  18. #define se second
  19. #define mp make_pair
  20.  
  21. tt tt0;
  22.  
  23. struct MinQue {
  24. vector<pair<tt, tt> > A[2];
  25. MinQue() {
  26. A[0] = A[1] = vector<pair<tt, tt> > (1, mp(tt0, tt0));
  27. }
  28. void push(int t, tt x) {
  29. A[t].push_back(mp(x, min(A[t].back().se, x)));
  30. }
  31. void norm() {
  32. if (A[1].size() == 1) {
  33. while (A[0].size() > 1) {
  34. push(1, A[0].back().fi);
  35. A[0].pop_back();
  36. }
  37. }
  38. }
  39. void push(tt x) {
  40. push(0, x);
  41. }
  42. void pop() {
  43. norm();
  44. A[1].pop_back();
  45. }
  46. tt get() {
  47. return min(A[0].back().se, A[1].back().se);
  48. }
  49. };
  50.  
  51. int main() {
  52. ios_base::sync_with_stdio(0);
  53. cin.tie(0);
  54. tt0 = mp(LINF, mp(-1, -1));
  55. int n, m, a, b, c, d;
  56. cin >> n >> m >> a >> b >> c >> d;
  57. swap(n, m);
  58. swap(a, b);
  59. swap(c, d);
  60. for (int i = 1; i <= n; i++) {
  61. for (int j = 1; j <= m; j++) {
  62. ll x;
  63. cin >> x;
  64. S[i][j] = S[i - 1][j] + S[i][j - 1] - S[i - 1][j - 1] + x;
  65. }
  66. }
  67. for (int i = 1; i + c - 1 <= n; i++) {
  68. for (int j = 1; j + d - 1 <= m; j++) {
  69. int i2 = i + c - 1;
  70. int j2 = j + d - 1;
  71. B[i][j] = mp(S[i2][j2] - S[i - 1][j2] - S[i2][j - 1] + S[i - 1][j - 1], mp(i, j));
  72. }
  73. }
  74. int da = a - c - 1;
  75. int db = b - d - 1;
  76. for (int i = 1; i + c - 1 <= n; i++) {
  77. MinQue Q;
  78. for (int j = 1; j <= db; j++) {
  79. Q.push(B[i][j]);
  80. }
  81. for (int j = 1; j + d - 1 + db - 1 <= m; j++) {
  82. B[i][j] = Q.get();
  83. Q.push(B[i][j + db]);
  84. Q.pop();
  85. }
  86. }
  87.  
  88. for (int j = 1; j + d - 1 + db - 1 <= m; j++) {
  89. MinQue Q;
  90. for (int i = 1; i <= da; i++) {
  91. Q.push(B[i][j]);
  92. }
  93. for (int i = 1; i + c - 1 + da - 1 <= n; i++) {
  94. B[i][j] = Q.get();
  95. Q.push(B[i + da][j]);
  96. Q.pop();
  97. }
  98. }
  99.  
  100. for (int i = 1; i + c - 1 + da - 1 <= n; i++) {
  101. for (int j = 1; j + d - 1 + db - 1 <= m; j++) {
  102. }
  103. }
  104. pair<ll, pair<pair<int, int>, pair<int,int> > > ans = mp(-1, mp(mp(-1, -1), mp(-1, -1)));
  105. for (int i = 1; i + a - 1 <= n; i++) {
  106. for (int j = 1; j + b - 1 <= m; j++) {
  107. ll s = S[i + a - 1][j + b - 1] - S[i + a - 1][j - 1] - S[i - 1][j + b - 1] + S[i - 1][j - 1];
  108. auto cur = mp(s - B[i + 1][j + 1].fi, mp(mp(i, j), B[i + 1][j + 1].se));
  109. ans = max(cur, ans);
  110. }
  111. }
  112. cout << ans.se.fi.se << " " << ans.se.fi.fi << endl;
  113. cout << ans.se.se.se << " " << ans.se.se.fi << endl;
  114. return 0;
  115. }
Advertisement
Add Comment
Please, Sign In to add comment