Mai intai trebuie sa te autentifici.
Cod sursa(job #2217930)
| Utilizator | Data | 2 iulie 2018 17:15:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
int N, i, x, f, l;
long long sum = 0, mi = 1000000000, ma = -1000000000;
vector<long long> v;
fin >> N;
for (int i = 0; i < N; i++) {
fin >> x;
sum += x;
v.push_back(sum);
if (mi > sum) {
mi = sum;
f = i + 2;
}
if (ma < sum) {
ma = sum;
l = i + 1;
}
}
fout << ma - mi << " " << f << " " << l;
}
