Cod sursa(job #1461013)
Utilizator | Data | 14 iulie 2015 15:58:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("ssmax.in");
ofstream g("ssmax.out");
int v[1001];
int main()
{
int n, i,sc,ic,smax,im,sfm;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sc=smax=v[1];
ic=im=sfm=1;
for(i=2;i<=n;i++)
{
if(sc+v[i]<v[i])
{
sc=v[i];
ic=i;
}
else sc=sc+v[i];
if(sc>smax)
{
smax=sc;
sfm=i;
}
}
g<<smax<<' '<<ic<<' '<<sfm;
return 0;
}