Re: 10684 - The Jackpot
Posted: Fri Sep 27, 2013 11:36 pm
You can solve each input set in O(N)
Code: Select all
#include<stdio.h>
#include<string.h>
int main(){
freopen("10684uva.txt","r",stdin);
long int a[1000],n,i=1,t[10000],max=-999999,j,cc;
t[0]=0;
while(scanf("%lld",&n)==1)
{
if(n==0)break;
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
t[i]=t[i-1]+a[i];
}
/*for(i=1;i<=n;i++)
printf("%d ",t[i]);*/
max=-1;
if(n!=1)
{
for(i=2;i<=n;i++)
for(j=0;j<i;j++)
{
cc=t[i]-t[j];
if(cc>max) max=cc;
}
if(max>0) printf("The maximum winning streak is %d.\n",max);
else printf("Losing streak.\n");
max=-1;
}
else if(a[1]>0) printf("The maximum winning streak is %d.\n",max);
else printf("Losing streak.\n");
memset(a,0,n);
memset(t,0,n);
}
}