Cod sursa(job #615169)
| Utilizator | Data | 8 octombrie 2011 19:04:38 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
int n,x,bestsum=-99999,beg,end,id,sum=0;
ifstream fin("ssm.in");
fin>>n;
for(int i=1;i<=n;++i)
{
fin>>x;
if(sum<0)
sum=x,id=i;
else
sum+=x;
if(sum>bestsum)
bestsum=sum,beg=id,end=i;
}
fin.close();
ofstream fout("ssm.out");
fout<<bestsum<<" "<<beg<<" "<<end;
fout.close();
return 0;
}
