Cod sursa(job #2973312)
Utilizator | Data | 31 ianuarie 2023 18:38:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,s,smax,st,aux,dr;
int v[6000004];
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>v[i];
}
s=smax=v[1];
st=dr=1;
for(i=2; i<=n; i++)
{
if(s<0)
{
s=v[i];
aux=i;
}
else
s=s+v[i];
if(s>smax)
{
smax=s;
st=aux;
dr=i;
}
}
g<<smax<<" "<<st<<" "<<dr;
return 0;
}