Cod sursa(job #2098751)
Utilizator | Data | 3 ianuarie 2018 14:43:03 | |
---|---|---|---|
Problema | Xor Max | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
#include <cmath>
using namespace std;
int v[100002];
int main()
{
int n,i,j,a,b,maxim,q;
ifstream in("xormax.in");
ofstream out("xormax.out");
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
}
maxim=0;
for(i=1;i<n;i++)
{
q=v[i];
for(j=i+1;j<=n;j++)
{
q^=v[j];
if(q>maxim)
{
maxim=q;
a=i;
b=j;
}
}
}
out<<maxim<<" "<<a<<" "<<b;
return 0;
}