Cod sursa(job #2558968)
Utilizator | Data | 26 februarie 2020 21:45:10 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,mx,s,dr,st,sum,st1;
int main()
{
f>>n;
st=1;
st1=1;
int mx = -int(2e9);
for(i=1; i<=n; i++)
{
f>>s;
if(sum<0)
{
sum=s;
st1=i;
}
else
sum+=s;
if(mx<sum)
{
mx=sum;
st=st1;
dr=i;
}
}
g<<mx<<" "<<st<<" "<<dr;
}