Cod sursa(job #782565)
| Utilizator | Data | 28 august 2012 12:05:23 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
ifstream in ("ssm.in");
ofstream out ("ssm.out");
int n, tmp, sum = 0, best = -1000000, start, final, index;
in >> n;
for(int i = 1; i <= n; i++)
{
in >> tmp;
if(sum < 0)
{
sum = tmp;
index = i;
}
else
{
sum += tmp;
}
if(best < sum)
{
best = sum, start = index, final = i;
}
}
out << best << " " << start << " " << final;
in.close();
out.close();
return 0;
}
