Cod sursa(job #1960229)
Utilizator | Data | 10 aprilie 2017 12:01:16 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ifstream fin("fis.in");
int n,a[100],smax=-1,s=0,start,finish,m;
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
for(int i=1;i<=n;i++){
if(s<0){
s=a[i];
m=i;
}
else
s+=a[i];
if(smax<s)
{
smax=s;
start=m;
finish=i;
}
}
cout<<smax<<" "<<start<<" "<<finish;
return 0;
}