Cod sursa(job #1822255)
| Utilizator | Data | 4 decembrie 2016 16:56:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int s[6000005];
int main()
{
int n, best = 1, mx = -1, mn = 0, st = 0, dr = 1, st2 = 0;
in >> n;
for(int i = 1; i <= n; i ++)
{
int a;
in >> a;
s[i] = s[i - 1] + a;
if(s[i] - mn > mx)
mx = s[i] - mn, dr = i, st2 = st;
if(mn > s[i])
mn = s[i], st = i;
}
out << mx << " " << st2 + 1 << " " << dr;
return 0;
}
