Cod sursa(job #1624884)
| Utilizator | Data | 2 martie 2016 14:27:31 | |
|---|---|---|---|
| Problema | Buline | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.89 kb |
#include <fstream>
using namespace std;
ifstream f("buline.in");
ofstream g("buline.out");
int i,j,l,p;
int a[400001];
int n,Nr,grad;
long long s=-20000;
int Max=-99999,lm,pm;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>Nr>>grad;
a[i]=Nr*(grad*2-1);
a[i+n]=a[i];
}
for(i=1;i<=n*2;i++)
{
if(s+a[i]>a[i])
{
s+=a[i];
l++;
if(s>Max)
{
Max=s;
lm=l;
pm=p;
}
}
else
{
if(s>Max)
{
Max=s;
lm=l;
pm=p;
}
s=a[i];
l=1;
p=i;
}
if(l==n)
{
break;
}
}
g<<Max<<" "<<pm<<" "<<lm;
return 0;
}
