Cod sursa(job #1959776)
Utilizator | Data | 9 aprilie 2017 21:38:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n,a[6000001],i,sum,sumMax=-99999999999,Beg,End,idx;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++){
if(sum<0)sum=a[i],idx=i;
else sum+=a[i];
if(sumMax<sum)
sumMax=sum,Beg=idx,End=i;
}
g<<sumMax<<" "<<Beg<<" "<<End;
}