Pagini recente » Cod sursa (job #237326) | Cod sursa (job #2767426) | Statistici Florescu Oana Cristina (OanaCristina) | Cod sursa (job #845255) | Cod sursa (job #953507)
Cod sursa(job #953507)
#include<fstream>
#define NMAX 100005
using namespace std;
int v[NMAX],DP[NMAX],n,p1,p2,sol=-1;
ifstream fin("xormax.in");
char input[NMAX],*in;
void read()
{
ifstream fin("xormax.in");
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
fin.close();
}
int atoi()
{
int nr=0;
for(;!(*in>='0' && *in<='9');in++);
for(;(*in>='0' && *in<='9') && *in;in++)
{
nr=nr*10+(*in-'0');
if(!*(in+1))
{
fin.read(input,NMAX);
in=input;
}
}
return nr;
}
void parse()
{
fin.read(input,NMAX);
in=input;
n=atoi();
for(int i=1;i<=n;i++)
v[i]=atoi();
fin.close();
}
int main()
{
read();
/*for(int i=1;i<=n;i++)
DP[i]=DP[i-1]^v[i];
for(int i=1;i<=n;i++)
for(int j=1;j<=i;j++)
{
if(sol==(DP[i]^DP[j-1]))
if(i-j<p2-p1 && i==p2)
p1=j;
if(sol<(DP[i]^DP[j-1]))
{
p1=j;
p2=i;
sol=DP[i]^DP[j-1];
}
}
ofstream fout("xormax.out");
fout<<sol<<' '<<p1<<' '<<p2<<'\n';
fout.close();*/
//parse();
return 0;
}