Cod sursa(job #2568751)
Utilizator | Seres Artur Artur26 | Data | 4 martie 2020 09:42:44 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,v[1000001],smax,pozi,pozj;
void rezolvare()
{
int i,s=-1,aux;
smax=-1;
aux=1;
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
if(s<0)
{
s=0;
aux=i;
}
s=s+v[i];
if(s>smax)
{
smax=s;
pozi=aux;
pozj=i;
}
}
g<<smax<<'\n';
g<<pozi<<'\n';
g<<pozj<<'\n';
}
int main()
{
rezolvare();
return 0;
}