Cod sursa(job #1375490)
Utilizator | Data | 5 martie 2015 13:23:00 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,s,smax,k,i,sf,in,x;
int main()
{
fin>>n;
fin>>s;
smax=s;k=1;
for(i=2;i<=n;i++)
{
fin>>x;
s=s+x;k++;
if(s>smax){smax=s;in=i-k+1;sf=i;}
if(s<0){s=0;k=0;}
}
fout<<smax<<' '<<in<<' '<<sf;
return 0;
}