Cod sursa(job #1526983)
| Utilizator | Data | 17 noiembrie 2015 18:56:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
#define MAX 6000100
int a[MAX];
int main()
{
int n, i, mi, maxim, x, y;
fin >> n;
mi = 0;
for(i = 1 ; i <= n ; i++)
{
fin >> a[i];
a[i] += a[i - 1];
if(a[i] - a[mi] > maxim)
{
maxim = a[i] - a[mi];
x = mi;
y = i;
}
if(a[mi] > a[i])
mi = i;
}
fout << a[y] - a[x] << " " << x + 1 << " " << y << "\n";
}
