zoukankan      html  css  js  c++  java
  • Hdu 1003 Max Sum

    #include <stdio.h>
    int
    a,b[100001],sum;
    int
    main()
    {

        int
    t,i,n,j,k,a1,b1,max;
        scanf("%d",&t);
        for
    (j=1;j<=t;j++)
        {

            scanf("%d",&n);
            max=-9999;sum=0;
            for
    (i=k=1;i<=n;i++)
            {

                scanf("%d",&a); sum+=a;
                    if
    (max<sum)
                    {

                        max=sum;
                        b1=i;a1=k;
                    }

                    if
    (sum<0)
                    {
    sum=0;
                    k=i+1;
                    }       
            }
           
            printf("Case %d:\n",j);
            printf("%d %d %d\n",max,a1,b1);       
            if
    (j!=t)printf("\n");
        }

        return
    0;
    }

  • 相关阅读:
    2016.7.31整机升级计划
    UVa 1588
    UVa1587
    Jzoj4714 公约数
    Jzoj4714 公约数
    Jzoj4713 A
    Jzoj4713 A
    Jzoj4711 Binary
    Jzoj4711 Binary
    Jzoj4710 Value
  • 原文地址:https://www.cnblogs.com/zxj015/p/2740305.html
Copyright © 2011-2022 走看看