Cod sursa(job #2767992)
Utilizator | Data | 8 august 2021 21:23:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
int n, x;
fin >> n;
vector<int> a;
for(int i = 1; i <= n; i++)
fin >> x, a.push_back(x);
int sum = 0, maxi = 0, r , l;
for(int i = 1; i <= n; i++)
{
if(a[i] > sum + a[i])
sum = a[i], l = i, r = i;
else
sum = sum + a[i], r++;
maxi = max(maxi, sum);
}
fout << maxi << " " << l + 1 << ' ' << r - 1;
return 0;
}