Pagini recente » Cod sursa (job #1891421) | Cod sursa (job #1136529) | Cod sursa (job #1125468) | Cod sursa (job #1682376) | Cod sursa (job #1899531)
#include<cstdio>
#include<algorithm>
using namespace std;
FILE* in = fopen("ssm.in", "r");
FILE* out = fopen("ssm.out", "w");
int d[6000007];
int main()
{
int n, a, maxnr = 0, inc = 1, sf, tmp = 1;
fscanf(in, "%d", &n);
fscanf(in, "%d", &a);
maxnr = a;
d[1] = a;
for(int i = 2; i <= n; ++i)
{
fscanf(in, "%d", &a);
if(d[i - 1] + a <= 0)
{
d[i] = 0;
tmp = i + 1;
}
else d[i] = d[i - 1] + a;
int nr = max(d[i - 1], d[i]);
if(maxnr < nr)
{
maxnr = nr;
sf = i;
inc = tmp;
}
}
fprintf(out, "%d %d %d", maxnr, inc, sf);
}