Cod sursa(job #2484716)
| Utilizator | Data | 31 octombrie 2019 14:57:56 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssn.in");
ofstream g("ssn.out");
int i,i1,maxim=-2100000,x,pozi,pozj,suma=-1,n;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
if(suma>=0)
suma=suma+x;
else
{
i1=i;
suma=x;
}
if(suma>maxim)
{
maxim=suma;
pozi=i1;
pozj=i;
}
}
g<<maxim<<" "<<pozi<<" "<<pozj;
return 0;
}
