Pagini recente » Cod sursa (job #166225) | Cod sursa (job #1242914) | Cod sursa (job #1256757) | Cod sursa (job #244558) | Cod sursa (job #292285)
Cod sursa(job #292285)
#include <iostream>
#include <limits.h>
using namespace std;
FILE *f = fopen("ssm.in", "r"), *g = fopen("ssm.out", "w");
int *a, *b, N, li = 0, ls = 0, sMax = INT_MIN, sTemp = 0, liT = 0, lsT = 0;
int main()
{
fscanf(f, "%d", &N);
a = new int[N];
for (int i = 0; i < N; ++i)
{
fscanf(f, "%d", &a[i]);
}
fclose(f);
/*
for (int i = 0; i < N; ++i)
{
if (a[i] > 0)
{
sTemp += a[i];
}
if (a[i] == 0)
{
if (sTemp > sMax)
{
li = liT, ls = i - 1, sMax = sTemp;
}
}
if (a[i] < 0)
{
if (a[i] + sTemp < 0)
{
if (a[i] > sMax)
{
li = liT, ls = i, sMax = a[i];
liT = i + 1;
sTemp = 0;
}
else
{
liT = i + 1;
sTemp = 0;
}
}
else
{
if (sTemp > sMax)
{
sMax = sTemp, li = liT, ls = i - 1;
}
if (a[i] + sTemp >= 0)
{
sTemp += a[i];
}
}
}
}
if ((sTemp > sMax) && (sTemp != 0))
{
sMax = sTemp, li = liT, ls = N - 1;
}
*/
b = new int[N];
b[0] = a[0];
for (int i = 1; i < N; ++i)
{
b[i] = max(a[i], b[i - 1] + a[i]);
}
for (int i = 0; i < N; ++i)
{
if (b[i] > sMax)
{
sMax = b[i];
ls = i;
}
}
if (sMax <= 0)
{
li = ls = ls + 1;
}
else
{
int i = ls;
while (b[i - 1] >= 0)
{
i--;
}
li = i + 1;
ls ++;
}
fprintf(g, "%d %d %d", sMax, li, ls);
//fprintf(g, "%d %d %d", sMax, li + 1, ls + 1);
fclose(g);
}