Cod sursa(job #781104)
| Utilizator | Data | 23 august 2012 12:37:48 | |
|---|---|---|---|
| Problema | Xor Max | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream f("xormax.in");
ofstream g("xormax.out");
int N,i,j,a[100001],s[100001],maxim,pozi,pozf;
int main()
{f>>N;
for(i=1; i<=N; i++)
{f>>a[i];
s[i]=s[i-1]^a[i];}
maxim=s[1];
pozi=1; pozf=1;
for(i=2; i<=N; i++)
for(j=1; j<i; j++)
if((s[i]^s[j])>maxim)
{maxim=(s[i]^s[j]);
pozi=j+1;
pozf=i;}
g<<maxim<<" "<<pozi<<" "<<pozf;
/*g<<endl;
for(i=1; i<=N; i++)
g<<s[i]<<" "; */
f.close();
g.close();
return 0;}
