Cod sursa(job #3246396)
Utilizator | Data | 2 octombrie 2024 21:12:47 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, a[6000005];
int main()
{
int i, p, k, j;
long long s, smax;
fin >> n;
for(i = 1; i <= n; i++)
fin >> a[i];
s = smax = a[1]; p = k = 1;
if(s < 0)
{
s = 0;
k = 2;
}
for(i = 2; i <= n; i++)
{
s += a[i];
if(s > smax)
{
smax = s;
p = i;
j = k;
}
if(s < 0)
{
s = 0;
k = i + 1;
}
}
fout << smax << " " << j << " " << p;
return 0;
}