Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- #define task "a"
- typedef long long ll;
- typedef pair<ll, pair<int, int> > tt;
- const int maxN = 1 << 10;
- const ll LINF = (ll)1e18;
- ll S[maxN][maxN];
- tt B[maxN][maxN];
- #define fi first
- #define se second
- #define mp make_pair
- tt tt0;
- struct MinQue {
- vector<pair<tt, tt> > A[2];
- MinQue() {
- A[0] = A[1] = vector<pair<tt, tt> > (1, mp(tt0, tt0));
- }
- void push(int t, tt x) {
- A[t].push_back(mp(x, min(A[t].back().se, x)));
- }
- void norm() {
- if (A[1].size() == 1) {
- while (A[0].size() > 1) {
- push(1, A[0].back().fi);
- A[0].pop_back();
- }
- }
- }
- void push(tt x) {
- push(0, x);
- }
- void pop() {
- norm();
- A[1].pop_back();
- }
- tt get() {
- return min(A[0].back().se, A[1].back().se);
- }
- };
- int main() {
- ios_base::sync_with_stdio(0);
- cin.tie(0);
- tt0 = mp(LINF, mp(-1, -1));
- int n, m, a, b, c, d;
- cin >> n >> m >> a >> b >> c >> d;
- swap(n, m);
- swap(a, b);
- swap(c, d);
- for (int i = 1; i <= n; i++) {
- for (int j = 1; j <= m; j++) {
- ll x;
- cin >> x;
- S[i][j] = S[i - 1][j] + S[i][j - 1] - S[i - 1][j - 1] + x;
- }
- }
- for (int i = 1; i + c - 1 <= n; i++) {
- for (int j = 1; j + d - 1 <= m; j++) {
- int i2 = i + c - 1;
- int j2 = j + d - 1;
- B[i][j] = mp(S[i2][j2] - S[i - 1][j2] - S[i2][j - 1] + S[i - 1][j - 1], mp(i, j));
- }
- }
- int da = a - c - 1;
- int db = b - d - 1;
- for (int i = 1; i + c - 1 <= n; i++) {
- MinQue Q;
- for (int j = 1; j <= db; j++) {
- Q.push(B[i][j]);
- }
- for (int j = 1; j + d - 1 + db - 1 <= m; j++) {
- B[i][j] = Q.get();
- Q.push(B[i][j + db]);
- Q.pop();
- }
- }
- for (int j = 1; j + d - 1 + db - 1 <= m; j++) {
- MinQue Q;
- for (int i = 1; i <= da; i++) {
- Q.push(B[i][j]);
- }
- for (int i = 1; i + c - 1 + da - 1 <= n; i++) {
- B[i][j] = Q.get();
- Q.push(B[i + da][j]);
- Q.pop();
- }
- }
- for (int i = 1; i + c - 1 + da - 1 <= n; i++) {
- for (int j = 1; j + d - 1 + db - 1 <= m; j++) {
- }
- }
- pair<ll, pair<pair<int, int>, pair<int,int> > > ans = mp(-1, mp(mp(-1, -1), mp(-1, -1)));
- for (int i = 1; i + a - 1 <= n; i++) {
- for (int j = 1; j + b - 1 <= m; j++) {
- 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];
- auto cur = mp(s - B[i + 1][j + 1].fi, mp(mp(i, j), B[i + 1][j + 1].se));
- ans = max(cur, ans);
- }
- }
- cout << ans.se.fi.se << " " << ans.se.fi.fi << endl;
- cout << ans.se.se.se << " " << ans.se.se.fi << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment