Cod sursa(job #1872590)
| Utilizator | Data | 8 februarie 2017 13:39:10 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
#define NMax 7000005
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, S[NMax];
int bestsum = -int(2e9), sum, inceput, sfarsit, idx;
int main()
{
f >> n;
for(int i = 1; i <= n; ++i)
f >> S[i];
for(int i = 1; i <= n; ++i)
{
if(sum < 0)
{
sum = S[i];
idx = i;
}
else sum += S[i];
if(bestsum < sum)
{
bestsum = sum;
inceput = idx;
sfarsit = i;
}
}
g << bestsum << " " << inceput << " " << sfarsit << '\n';
return 0;
}
