Pagini recente » Cod sursa (job #886948) | Cod sursa (job #2872076) | Cod sursa (job #2693196) | Cod sursa (job #384619) | Cod sursa (job #1603800)
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout("ssm.out");
#define INFINIT 0x3f3f3f3
long long sum[6000001];
int main()
{
long long n, x, Min = 0, bestSum = -INFINIT, aux, pozMin, pozMax;
fin >> n;
for(int i = 1; i <= n; i++)
{
fin >> x;
sum[i] = x + sum[i - 1];
}
for(int i = 1; i <= n; i++)
{
if(Min > sum[i])
{
Min = sum[i];
aux = i;
}
if(bestSum < sum[i] - Min)
{
bestSum = sum[i] - Min;
pozMin = aux + 1;
pozMax = i;
}
}
fout << bestSum << " " << pozMin << " " << pozMax;
return 0;
}