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