Cod sursa(job #701175)
| Utilizator | Data | 1 martie 2012 14:12:03 | |
|---|---|---|---|
| Problema | Xor Max | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<fstream>
using namespace std;
int main()
{ifstream f("xormax.in");
ofstream g("xormax.out");
int i,j,a[100],n,q,b,c,max,aux;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
max=(a[1]^a[2]);
b=1;
c=2;
for(i=0;i<=n;i++)
for(j=1;j<=n-i;j++)
{aux=a[j];
for(q=j+1;q<=j+i;q++)
aux=aux^a[q];
if(aux>max)
{max=aux;
b=j;
c=j+i;}
}
g<<max<<" "<<b<<" "<<c;
}
