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