Cod sursa(job #2007360)
| Utilizator | Data | 2 august 2017 16:20:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
int n,i,mi,imi,st,dr,ma=-2147483646;
int a[6000001],s[6000001];
ifstream fi("ssm.in");
ofstream fo("ssm.out");
int main()
{
fi>>n;
for(i=1; i<=n; i++)
{
fi>>a[i];
s[i]=s[i-1]+a[i];
}
mi=2147483646;
for(i=1;i<=n;i++)
{
if(s[i]<mi)
{
mi=s[i];
imi=i;
}
if(s[i]-mi>ma)
{
ma=s[i]-mi;
st=imi+1;
dr=i;
}
}
fo<<ma<<" "<<st<<" "<<dr;
}
