30分求调

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

const int N = 10100000;

int a[N], l[N], r[N];
int n;

void build() {
    stack<int> st;
    for (int i = 1; i <= n; i++) {
        l[i] = r[i] = 0;
    }
    for (int i = 1; i <= n; i++) {
        int last = 0;
        while (!st.empty() && a[st.top()] > a[i]) {
            last = st.top();
            st.pop();
        }
        if (!st.empty()) r[st.top()] = i;
        l[i] = last;
        st.push(i);
    }
}

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    build();
    ll ans = 0;
    for (int i = 1; i <= n; i++) ans ^= 1LL * i * (l[i] + 1);
    printf("%d ", ans);
    ans = 0;
    for (int i = 1; i <= n; i++) ans ^= 1LL * i * (r[i] + 1);
    printf("%d ", ans);
}