Pagini recente » Cod sursa (job #2649315) | Cod sursa (job #2428461) | Istoria paginii runda/miada | Cod sursa (job #1947016) | Cod sursa (job #2567200)
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
std::deque<int>dp,dn;
int x[50001];
int main()
{
int n,k;
fin>>n>>k;
long long s=0,ma=0,pi=0,pf=0;
for(int i=1;i<=n;i++)
{
fin>>x[i];
if(x[i]>=0)
{
if(x[i]+s>=ma)
{
ma=s+x[i];
if(s==0)
{
pi=i;
}
else
{
pf=i;
}
}
s=s+x[i];
}
else
{
if(s+x[i]<0)
{
s=0;
}
else
{
s=s+x[i];
}
}
}
fout<<pi<<" "<<pf<<" "<<ma;
return 0;
}