Cod sursa(job #3217796)
| Utilizator | Data | 24 martie 2024 19:07:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 5 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[1001],n,nr,imax,jmax;
int main()
{
in>>n;
for(int i=1; i<=n; i++)
in>>v[i];
int suma = 0, sumaMax = 0;
for(int i = 0; i < n; i++)
{
suma = suma + v[i];
nr++;
if(suma < 0)
suma = 0, nr=0;
if(suma > sumaMax)
sumaMax = suma, imax=i-nr+1, jmax=i;
}
out<<sumaMax<<" "<<imax<<" "<<jmax;
}
