Cod sursa(job #1433001)
Utilizator | Data | 9 mai 2015 14:42:00 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("ssm.in");
ofstream fout ("ssm.out");
int n,i,max=-10000,st=1,dr,lung=0,a,s=0;
fin>>n;
dr=n;
for(i=1; i<=n; i++)
{
fin>>a;
s+=a;
if(s>max)
{
max=s;
dr=i;
lung=dr-st;
}
if(s<0)
{
if(s>=max)
{
max=s;
dr=i;
lung=dr-st;
}
s=0;
st=i+1;
}
}
if(max<0)
st=dr;
fout<<max<<" "<<dr-lung<<" "<<dr;
return 0;
}