Cod sursa(job #1577765)
| Utilizator | Data | 23 ianuarie 2016 20:03:27 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,i,sum=0,bestSum=INT_MIN,beg,end,idx,s;
fin>>n;
for(i=1;i<=n;++i)
{
fin>>s;
if(sum<0)
{sum=s; idx=i; }
else sum+=s;
if(bestSum<sum)
{
bestSum=sum; beg=idx; end=i;
}
}
fout<<bestSum<<" "<<beg<<" "<<end;
return 0;
}
