Cod sursa(job #2168595)
Utilizator | Data | 14 martie 2018 11:41:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s,smax,a[1002],n,lg,lgmax,ult;
void citire()
{fin>>n;
int i;
for(i=1;i<=n;i++)fin>>a[i];
}
void rezolva()
{int i;
s=smax=a[1];lg=lgmax=1;ult=1;
for(i=2;i<=n;i++)
if(s>=0)
{s=s+a[i];
lg++;
if(s>smax)
{smax=s;
ult=i;
lgmax=lg;
}
}
else
{s=a[i];
lg=1;
if(s>smax)
{
smax=s;
lgmax=lg;
ult=1;
}
}
fout<<smax<<" "<<ult-lgmax+1<<" "<<ult;
}
int main()
{
citire();
rezolva();
return 0;
}