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