Cod sursa(job #824360)
Utilizator | Traista traista.lamaita | Data | 26 noiembrie 2012 14:51:51 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,n, s, k,st,dr, v[7000005];
int smax =-1000000000;
int main()
{f>>n;
for(i=1;i<=n;++i) f>>v[i];
for(i=1;i<=n;++i)
{if(s<0)
{s=v[i]; k=i;}
else s+=v[i];
if (smax < s)
{smax = s; st = k; dr = i;}
}
g<< smax << " " << st << " " << dr;
g.close();
return 0;
}