Pagini recente » Cod sursa (job #3196471) | Cod sursa (job #2260507) | Cod sursa (job #3211503) | Cod sursa (job #2679529) | Cod sursa (job #25144)
Cod sursa(job #25144)
#include<fstream.h>
int main()
{
ifstream fin("buline.in");
ofstream fout("buline.out");
int a[16000],b[16000],N,i,j,k,l,max,s[16000],P,L;
fin>>N>>"\n";
i=1;
while(i<=N)
{
fin>>a[i];
fin>>b[i]>>"\n";
if(b[i]==0)a[i]=-a[i];
a[N+i]=a[i];
i=i+1;
}
i=N;
while(i>=1)
{
j=1;
while(j<=N)
{
k=1;
s[j]=0;
while(k<=i)
{
s[j]=s[j]+a[k];
k=k+1;
}
max=s[1];
l=2;
P=1;
L=i;
while(l<=N)
{
if(s[l]>max){
s[l]=max;
P=l;
L=i;
}
l=l+1;
}
j=j+1;
}
i=i-1;
}
fout<<max;
fout<<P;
fout<<L;
fin.close();
fout.close();
return 0;
}