Cod sursa(job #2509560)
Utilizator | Data | 14 decembrie 2019 13:12:45 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int x,n,s,m,p,st,dr;
int main()
{
fin>>n>>x;
s=m=x;
p=st=dr=1;
if(s<0)
{
s=0;
p=2;
}
for(int i=2;i<=n;i++)
{
fin>>x;
s+=x;
if(m<s)
{
m=s;
dr=i;
st=p;
}
if(s<0)
{
s=0;
p=i+1;
}
}
fout<<m<<" "<<st<<" "<<dr<<"\n";
fout.close();
return 0;
}