Cod sursa(job #2126609)
| Utilizator | Data | 9 februarie 2018 19:25:22 | |
|---|---|---|---|
| Problema | Xor Max | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int MAXN = 100005;
int v[MAXN];
int N;
int main()
{
ifstream in ("xormax.in");
ofstream out ("xormax.out");
in>>N;
int maxim = 0, curr, st, dr;
for (int i = 0; i <= N; ++i)
in>>v[i];
for (int i = 0; i < N; ++i)
for(int j = i + 1; j <= N; ++j)
{
curr = 0;
for(int k = i; k <= j; ++k)
curr = curr ^ v[k];
if(curr > maxim)
{
maxim = curr;
st = i;
dr = j;
}
}
out<<maxim<<" "<<st + 1<<" "<<dr + 1;
}
