Cod sursa(job #2487154)
Utilizator | Octavian Corbu Octavian703 | Data | 4 noiembrie 2019 08:31:12 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int a[100],i,n,smax=0,s=0,stmax,drmax,st;
f>>n;
st=stmax=drmax=1;
for(i=1;i<=n;i++)
f>>a[i];
smax=a[1];
s=a[1];
if(s<0)
s=0;
for(i=2;i<=n;i++)
{
s=s+a[i];
if(s>smax)
{
smax=s;
stmax=st;
drmax=i;
}
if(s<0)
{
s=0;
st=i+1;
}
}
g<<smax<<" "<<stmax<<" "<<drmax;
return 0;
}