Cod sursa(job #1372133)
Utilizator | Diana Orasanu dianaorasanu | Data | 4 martie 2015 11:41:03 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#define IN "ssm.in"
#define OUT "ssm.out"
using namespace std;
ifstream fin(IN);
ofstream fout(OUT);
int i, n, a[101], x, y, bestS, S, aux, sum;
bool ok;
int main()
{
fin >> n;
for(i = 1; i <= n; ++i)
{
fin >> S;
if(sum < 0)
sum = S, aux = i;
else
sum += S;
if(bestS < sum)
bestS = sum, x = aux, y = i;
}
fout << bestS << ' ' << x << ' ' << y << '\n';
return 0;
}