Pagini recente » Cod sursa (job #1606850) | Cod sursa (job #426708) | Cod sursa (job #3225246) | Cod sursa (job #2276679) | Cod sursa (job #1313546)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("xormax.in");
ofstream fout("xormax.out");
vector<int> SUM;
int n, elem, xormax, b, e;
int main() {
fin>>n;
SUM.push_back(0);
for(int i=1; i<=n; i++) {
fin>>elem;
SUM.push_back(SUM[i-1] xor elem);
}
for(int i=1; i<n; i++) for(int j=i+1; j<=n; j++)
if(xormax < (SUM[i] xor SUM[j])) {
xormax = SUM[i] xor SUM[j];
b = i+1;
e = j;
}
fout<<xormax<<" "<<b<<" "<<e;
return 0;
}