首页 > 其他 > 详细

PAT 01-2

时间:2015-01-02 23:32:19      阅读:433      评论:0      收藏:0      [点我收藏+]
#include<stdio.h> 
#include<stdlib.h>

int main()
{
    int k;
    int *data;
    int i;
    int ThisSum, MaxSum, FirstNum, LastNum, tempFir, tempLas;
    
    while(scanf("%d", &k) != EOF)
    {
        data = (int *)malloc(k * sizeof(int));
        for(i = 0; i < k; i++)
        {
            scanf("%d", &data[i]);
        }
        
        ThisSum = 0;
        MaxSum = 0;
        FirstNum = 0;
        LastNum = k - 1;
        tempFir = 0;
        tempLas = 0;
        
        for(i = 0; i < k; i++)
        {
            if(ThisSum >= 0)
            {
                ThisSum += data[i];
                tempLas = i;
            }
            else
            {
                ThisSum = data[i];
                tempFir = i;
                tempLas = i;
            }
            if(ThisSum > MaxSum  || ((LastNum == k - 1)&&(ThisSum == 0)))
            {
                MaxSum = ThisSum;
                FirstNum = tempFir;
                LastNum = tempLas;
            }
        }
        printf("%d %d %d", MaxSum, data[FirstNum], data[LastNum]);
    }
}

 

PAT 01-2

原文:http://www.cnblogs.com/happyhacking/p/4198950.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!