【第37题】2023北京高考数学压轴题遇上oier，三年OI不是空，毕竟高考还有用！

#include <bits/stdc++.h>
using namespace std;

struct edge {
    bool b;
    int l, r;
};

void out (int l1, int r1, int l2, int r2) {
    cout << r1 - l1 + 1 << endl;
    for (int i = l1; i <= r1; ++i) {
        cout << i << " ";
    }
    cout << endl;
    cout << r2 - l2 + 1 << endl;
    for (int i = l2; i <= r2; ++i) {
        cout << i << " ";
    }
}

void solve(vector<long long> a, vector<long long> b, int n, bool k) {
    vector<edge> ans(n);
    int l = 0, r = 0;
    for (; l <= n && r <= n; ++l) {
        while (a[l] > b[r]) {
            ++r;
        }
        if (!ans[b[r] - a[l]].b) {
            ans[b[r] - a[l]].l = l;
            ans[b[r] - a[l]].r = r;
            ans[b[r] - a[l]].b = true;
        } else {
            if (k) {
                out(ans[b[r] - a[l]].l + 1, l, ans[b[r] - a[l]].r + 1, r);
            } else {
                out(ans[b[r] - a[l]].r + 1, r, ans[b[r] - a[l]].l + 1, l);
            }
            break;
        }
    }
}

void best_coder() {
    int n;
    cin >> n;
    vector<long long> a(n + 1);
    vector<long long> b(n + 1);

    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        a[i] += a[i -1];
    }
    for (int i = 1; i <= n; ++i) {
        cin >> b[i];
        b[i] += b[i - 1];
    }
    if (a[n] < b[n]) {
        solve(a, b, n, true);
    } else {
        solve(b, a, n, false);
    }
}

void happy_coder() {
}

int main() {
    // 提升cin、cout效率
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    // 小码匠
    best_coder();

    // 最优解
    // happy_coder();

    // 返回
    return 0;
}