Cod sursa(job #2495093)
Utilizator | Raulea Rares raresraulea | Data | 18 noiembrie 2019 21:21:39 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("sumainsecv.in");
ofstream fout("sumainsecv.out");
int v[101], i, j, n, imax, jmax, Scrt = 0, Smax = 0;
long long SP[101];
fin >> n;
SP[0] = 0;
for (i = 1; i <= n; i++)
{
fin >> v[i];
SP[i] = SP[i - 1] + v[i];
}
for (i = 1; i <= n; i++)
{
for (j = i; j <= n; j++)
{
Scrt = SP[j] - SP[i - 1];
if (Scrt > Smax) {
Smax = Scrt;
imax = i;
jmax = j;
i = n; j = n;
}
}
}
cout << Smax << ' ' << imax << ' ' << jmax;
}