Pagini recente » Cod sursa (job #1406111) | Cod sursa (job #3193680) | Cod sursa (job #2657052) | Cod sursa (job #2870362) | Cod sursa (job #290515)
Cod sursa(job #290515)
#include <stdio.h>
#define nm 6000010
int n, i, s, sol, p1, p1i, p2;
int x;
void read()
{
scanf("%d ", &n);
//for (i=1; i<=n; ++i)
// scanf("%d ", &v[i]);
}
void solve()
{
s = 0;
p1 = 1;
sol = s;
for (i=1; i<=n; ++i)
{
scanf("%d ", &x);
s+= x;
if (s < 0)
{
s = 0;
p1 = i+1;
}
if (s > sol)
{
sol = s;
p2 = i;
p1i = p1;
}
else
if (s == sol && (i-p1) < (p2-p1i))
{
p2 = i;
p1i = p1;
}
}
}
void write()
{
printf("%d %d %d\n", sol, p1i, p2);
}
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out","w",stdout);
read();
solve();
write();
return 0;
}