Cod sursa(job #2414548)
| Utilizator | Data | 24 aprilie 2019 18:22:56 | |
|---|---|---|---|
| Problema | Xor Max | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream f("xormax.in");
ofstream g("xormax.out");
int n,s[100001],pi,pim,pfm,sm,v[100001];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i],s[i]=s[i-1]^v[i];
for(int i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
{
int x=s[j]^s[i-1];
if(x>sm)
{
sm=x;
pim=i;
pfm=j;
}
else if(x==sm)
{
if(pfm==j)
pim=max(pim,i);
else pfm=min(pfm,j);
}
}
g<<sm<<" "<<pim<<" "<<pfm<<'\n';
return 0;
}
