Cod sursa(job #497736)
| Utilizator | Data | 3 noiembrie 2010 11:17:38 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<cstdio>
using namespace std;
int v[6000001];
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int n,i,j;
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&v[i]);
int sc=0,st=1,smax=0,stmax=0,drmax=0;
i=1;
while(st<=i && i<=n)
{
++i;
sc=sc+v[i];
if(sc>smax)
{
smax=sc;
stmax=st;
drmax=i;
}
if(i==n)
{
sc=v[st+1];
++st;
i=st;
}
}
printf("%d %d %d",smax,stmax,drmax);
return 0;
}
