Cod sursa(job #2472292)
Utilizator | Data | 12 octombrie 2019 11:03:51 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int s,l,smax=-pow(2,30),st,sfc;
int main()
{
int n;
f>>n;
for(int i=1;i<=n;i++)
{
int nr;
f>>nr;
if(s+nr>=nr)s+=nr;
else {s=nr;l=i;}
if(s>smax)
{
smax=s;
st=l;
sfc=i;
}
else
{
if(smax==s&&l<st)
{
st=l;
sfc=i;
}
}
}
g<<smax<<' '<<st<<' '<<sfc;
return 0;
}