Mai intai trebuie sa te autentifici.
Cod sursa(job #2037260)
Utilizator | Data | 11 octombrie 2017 22:09:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000010],i,j,pozb=1,poz=1,fin=1,n;
long long s=0,sbest=0;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
}
sbest=a[1];
for(i=1;i<=n;i++)
{
s=s+a[i];
if(s>sbest)
{
sbest=s;
pozb=poz;
fin=i;
}
if(s<0)
{
s=0;
poz=i+1;
}
}
g<<sbest<<' '<<pozb<<' '<<fin;
}