Cod sursa(job #2171748)
Utilizator | Data | 15 martie 2018 13:24:31 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,a[6000005],max1=-999999,s,j,st,dr,n;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
s=s+a[i];
if(s>max1)
{
max1=s;
dr=j;
st=i;
}
if(s<a[i])
{
s=0;
j=i;
i--;
}
}
g<<max1<<" "<<dr<<" "<<st;
return 0;
}