Cod sursa(job #1125744)
| Utilizator | Data | 26 februarie 2014 19:17:03 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<cstdio>
using namespace std;
int n,min,poz,i,x,s,best,a,b;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n); min=0; poz=0; best=(1<<31)-1;
for(i=1;i<=n;i++)
{
scanf("%d",&x); s+=x;
if(s-min>best)
{
best=s-min;
a=poz+1; b=i;
}
if(s<min)
{
min=s;
poz=i;
}
}
printf("%d %d %d\n",best,a,b);
return 0;
}
