Cod sursa(job #562053)
| Utilizator | Data | 22 martie 2011 10:23:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<iostream>
#include<stdio.h>
using namespace std;
int v[6000001],sum[5000000],N;
int main()
{ int i,p=0,u=0,smax=-99999999,c=0;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
cin>>N;
for(i=1;i<=N;++i)
{cin>>v[i];
sum[i]=0;}
for(i=1;i<=N;i++)
{
sum[i] = v[i] + sum[i-1];
c=c+1;
if(smax > sum[i]) { smax=i;
u=c-u;
}
}
cout<<u<<" "<<smax;
}