Pagini recente » Atasamentele paginii Clasament punetiosullatreaba | Cod sursa (job #313090) | Cod sursa (job #1291281) | Cod sursa (job #1736145) | Cod sursa (job #133652)
Cod sursa(job #133652)
#include<stdio.h>
#define Max 200003
FILE*f=fopen("buline.in","r");
FILE*g=fopen("buline.out","w");
int s[Max],t[Max],a[Max],smax,inc,sf,lung=0;
int n;
void read()
{
fscanf(f,"%d\n",&n);
int i,p;
for(i=1;i<=n;++i)
{
fscanf(f,"%d %d",&a[i],&p);
if(p==0) a[i]=-a[i];
}
}
void ParteaI()
{
int sc,p=1, sf=1;
int i;
smax=a[1];
for(i=1;i<=n;++i)
{
if(a[i]<0)
{
sc=a[i];
p=i;
}
else sc+=a[i];
if(sc>smax)
{
smax=sc;
inc=p;
sf=i;
}
}
lung=sf-inc+1;
}
void ParteaII()
{
int s[Max],t[Max];
int i,j,S,pi;
S=smax;
pi=inc;
s[0]=0;
for(i=1;i<=n;++i)
{
s[i]=s[i-1]+a[i];
t[i]=t[i-1];
if(s[i]>t[i]) t[i]=s[i];
}
for(i=2;i<=n;++i)
{
if(t[i-1]+s[n]-s[i-1]>smax)
{
smax=t[i-1]+s[n]-s[i-1];
inc=i;
}
}
if(smax>S || inc<pi )
{
int sum=0;
lung=1;
for(i=inc;;i=i%n+1)
{
sum+=a[i];
if(sum==smax)
{
sf=i;
break;
}
else lung++;
}
}
}
int main()
{
read();
ParteaI();
ParteaII();
fprintf(g,"%d %d %d\n",smax, inc, lung);
return 0;
}