Cod sursa(job #2473956)
Utilizator | Data | 14 octombrie 2019 15:43:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main() {
int n, v;
cin >> n;
int max = -1000000, min = 1000000, sum, sumAnte = 0;
int st, dr;
for (int i = 1; i <= n; ++i) {
cin >> v;
sum = sumAnte + v;
sumAnte = sum;
if (sum > max) {
max = sum;
dr = i;
}
if (sum < min) {
min = sum;
st = i + 1;
}
}
cout << max - min << " " << st << " " << dr;
return 0;
}