Cod sursa(job #1625578)
| Utilizator | Data | 2 martie 2016 19:42:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
int main()
{
int aux, in, sf, sum = 0, sum_max = INT_MIN, x;
fin >> n;
for(int i = 1; i <= n; i++)
{
fin >> x;
if(sum < 0)
sum = x, aux = i;
else
sum += x;
if(sum > sum_max)
sum_max = sum, in = aux, sf = i;
}
fout << sum_max << " " << in << " " << sf;
return 0;
}
