Submission #101977

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)

using namespace std;
typedef long long ll;

const int    INF = 1000000000;
const int    MOD = 1000000007;
const double EPS = 1e-8;

int main(){
    int N;
    while(cin >> N && N){
        vector<int> a(N);
        REP(i, N){
            cin >> a[i];
        }
        int cur = 0;
        int lasts = 1, lastt = 1;
        for(int b = 0; b < 20; b++){
            int B = cur >> (19 - b) | 1;
            //printf("b = %d B = %d\n", b, B);
            vector<int> sum(N + 1);
            for(int i = 0; i < N; i++) sum[i + 1] = sum[i] ^ (a[i] >> (19 - b));
            map<int, int> index;
            bool ok = false;
            for(int i = sum.size() - 1; i >= 0; i--){
                int want = sum[i] ^ B;
                if(index.count(want)){
                    lasts = i + 1;
                    lastt = index[want];
                    ok = true;
                }
                index[sum[i]] = i;
            }
            if(ok){
                cur = B << (19 - b);
            }else{
                cur = (B ^ 1) << (19 - b);
            }
        }
        printf("%d %d %d\n", cur, lasts, lastt);
    }
    return 0;
}

Submission Info

Judge Result