Cod sursa(job #627089)
| Utilizator | Data | 28 octombrie 2011 23:04:08 | |
|---|---|---|---|
| Problema | Xor Max | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream f("xormax.in");
ofstream g("xormax.out");
int main()
{
unsigned long a[100000],n,i,j,pi=0,pf=0,s=0,max=0;
f>>n;
for(i=0;i<n;i++)
f>>a[i];
for(i=0;i<n-1;i++)
{
s=0;
for(j=i;j<n-1 && a[j+1] && a[j]%a[j+1]==0 ;j++)
{
if(i==j)
pi=j+1;
pf=j+2;
s+=a[j]+a[j+1];
if(max<s || !max)
max=s;
}
}
g<<max<<' '<<pi<<' '<<pf<<'\n';
f.close();
g.close();
return 0;
}
