Cod sursa(job #1602552)
| Utilizator | Data | 16 februarie 2016 20:20:19 | |
|---|---|---|---|
| Problema | Xor Max | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("xormax.in");
ofstream g("xormax.out");
int a[100001],sum[100001],sum1,MAX=0,n,i,j,in,stop;
int main()
{
f>>n;
for (i=1;i<=n;i++)
f>>a[i];
for (i=1;i<=n;i++)
sum[i]=(sum[i-1]^a[i]);
for (i=n-1;i>=1;i--){
sum1=a[i];
for (j=i+1;j<=n;j++){
sum1=(sum1^a[j]);
if (sum1>MAX) in=i,stop=j,MAX=sum1;
}
}
g<<MAX<<' '<<in<<' '<<stop;
return 0;
}
