Pagini recente » Cod sursa (job #2560539) | Cod sursa (job #989606) | Cod sursa (job #2604409) | Cod sursa (job #1339608) | Cod sursa (job #2166030)
#include<fstream>
using namespace std;
ifstream fin("buline.in");
ofstream fout("buline.out");
const int NMax = 200005;
const int oo = 1 << 30;
int N,S,P,L;
int Best,Start;
int A[2*NMax];
void Read()
{
fin>>N;
for(int i = 1 ; i <= N ; ++i)
{
int val; bool col;
fin >> val >> col;
if(col) A[i] = A[i + N] = val;
else A[i] = A[i + N] = -val;
}
}
void Solve()
{
S = -oo;
for(int i = 1 ; i <= 2 * N ; ++i)
{
if(A[i] + Best < A[i])
{
Best = A[i];
Start = i;
}
else
if(i - Start + 1 <= N )
Best += A[i];
if(Best > S)
{
S = Best;
P = Start;
L = i - Start + 1;
}
}
}
void Print()
{
fout << S << " " << P << " " << L << "\n";
}
int main()
{
Read();
Solve();
Print();
fin.close();
fout.close();
return 0;
}