Cod sursa(job #1291883)
Utilizator | Vlad Stoleru vlad00 | Data | 13 decembrie 2014 14:24:44 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int v[6001],n,s[6001],smax=0,ic=1,imax=0,jmax=0;
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
for(int j=1; j<=n; j++)
{
s[j]=v[j]+s[j-1];
if(s[j]>smax)
{
smax=s[j];
jmax=j;
imax=ic;
}
if(s[j]<=0)
{
s[j]=0;
ic=j+1;
}
}
g<<smax<<' '<<imax<<' '<<jmax;
f.close();g.close();
return 0;
}