Cod sursa(job #1884255)
Utilizator | Data | 18 februarie 2017 16:09:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
int n,a[6000001],st,sf,ms,mf,s,ma,i,c;
int main()
{fi>>n;
for(i=1;i<=n;i++)
{
fi>>a[i];
s=s+a[i];
if(s>0)
{ if(s>ma)
{ma=s;
ms=i-c;
mf=i;
}
c++;
}
if(s<0)
{ c=0;
s=0;
st=i;
sf=i;
}
}
fo<<ma<<" "<<ms<<" "<<mf;
return 0;
}