Pagini recente » Cod sursa (job #746628) | Cod sursa (job #2214054) | Cod sursa (job #1103899) | Cod sursa (job #2401741) | Cod sursa (job #1568828)
#include <iostream>
#include <stdio.h>
using namespace std;
#define MAX 1024
int n,a[MAX],v[MAX],maxim;
int main()
{
int i,j;
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d",&n);
for(i=1; i<=n; ++i)
scanf("%d",&a[i]);
maxim=a[i];
for(i=1; i<=n; ++i)
{
v[i]=a[i];
if(v[i]<v[i-1]+a[i])
v[i]=v[i-1]+a[i];
if(maxim<v[i])
{
maxim=v[i];
j=i;
}
}
int max1=maxim;
int k=j;
while(max1)
{
max1-=a[k];
if(max1>0)
k--;
}
printf("%d %d %d ", maxim,k,j);
return 0;
}