Pagini recente » Cod sursa (job #407601) | Cod sursa (job #908716) | Cod sursa (job #3224870) | Cod sursa (job #2940107) | Cod sursa (job #29780)
Cod sursa(job #29780)
#include <fstream>
using namespace std;
#define MAX 200002
int a[MAX];
int smax;
int n;
ifstream fin ("buline.in");
ofstream fout ("buline.out");
int main()
{
fin >> n;
int nr, se;
for ( int i = 1; i <= n; i++ )
{
fin >> nr >> se;
if ( se == 0 )
{
a[i] = -nr;
}
else
{
a[i] = nr;
}
}
for ( int i = 1; i < n; i++ )
{
a[n+i] = a[i];
}
fin.close();
int i1 = 1;
int i;
int j;
smax = 0;
int s = 0;
for ( int k = 1; k < n + n; k++ )
{
if ( smax < s + a[k] )
{
smax = s + a[k];
s+=a[k];
i = i1;
j = k;
}
else
{
if ( s + a[k] > 0 )
{
s += a[k];
}
else
{
s = 0;
i1 = k + 1;
}
}
}
fout << smax << " " << i << " " << j - i + 1;
fout.close();
return 0;
}