Pagini recente » Borderou de evaluare (job #804674) | Borderou de evaluare (job #2632219) | Cod sursa (job #300011) | Cod sursa (job #1734592)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int maxim=-1,start=-1,stop=-1;
vector<unsigned long long> v;
int main(){
ifstream f("xormax.in");
ofstream g("xormax.out");
unsigned long long n,el;
f >> n;
f >> el;
v.push_back(el);
maxim = v[0];
start= stop =0;
for(unsigned long long i=1;i<n;i++){
f >> el;
for(unsigned long long j=0;j<v.size();j++){
v[j] = v[j] ^ el;
if(maxim < v[j]){
maxim = v[j];
start = j;
stop = i;
}
}
v.push_back(el);
if(v[i] > maxim){
maxim = v[i];
start = i;
stop = i;
}
}
g << maxim << ' ' << start + 1 << ' ' << stop + 1;
}