Pagini recente » Cod sursa (job #1132414) | Cod sursa (job #2709744) | Profil RolandPetrean | Cod sursa (job #1356775) | Cod sursa (job #3246476)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int Nmax = 6000005;
int s[Nmax], best;
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; ++i)
{
fin >> s[i];
s[i] += s[i - 1];
}
int mini_sum = 0, bestSum = INT_MIN, poz_st, poz_dr;
for(int i = 1; i <= n; ++i)
{
best = s[i] - mini_sum;
if (mini_sum > s[i])
{
mini_sum = s[i];
poz_st = i + 1;
}
if (bestSum < best)
{
bestSum = best;
poz_dr = i;
}
}
fout << bestSum << " " << poz_st << " " << poz_dr;
return 0;
}