Cod sursa(job #377888)
Utilizator | Idomir Alin idomiralin | Data | 26 decembrie 2009 20:00:00 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include<cstdio>
using namespace std;
int besti,i,n,s,a,best,pozi,pozfi,pozf,bestsum,lungime;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
scanf("%d",&a);
besti=a;bestsum=a;pozi=1;pozfi=pozf=1;
for (i=2;i<=n;i++)
{ scanf("%d",&a);
best=a;
if (best<=besti+a)
best=besti+a;
else
pozi=i;
besti=best;
if (bestsum<best)
{bestsum=best;
pozfi=pozi;
pozf=i;
}
}
printf("%d %d %d",bestsum,pozfi,pozf);
return 0;
}