PAT A 1007 Maximum Subsequence Sum Solved By C

#include <stdio.h>
#include <stdlib.h>
int main()
{
    int N,i,A[10002];
    int count=0;
    scanf("%d",&N);
    for(i=0; i<N; i++)
    {
        scanf("%d",&A[i]);
    }
    for(i=0; i<N; i++)
    {
        if(A[i]>=0)
        {
            count=1;
        }
    }
    int ThisSum,MaxSum;
    ThisSum=MaxSum=0;
    int tag1=A[0],tag2=0,tag3=0;
    if(count==0)
    {
        printf("%d %d %d",MaxSum,A[0],A[N-1]);
    }
    else
    {
        for(i=0; i<N; i++)
        {
            ThisSum+=A[i];

            if(ThisSum>MaxSum)
            {
                tag3=tag1;
                MaxSum=ThisSum;
                tag2=A[i];
            }
            else if(ThisSum<0)
            {
                ThisSum=0;
                tag1=A[i+1];
            }
        }

        printf("%d %d %d",MaxSum,tag3,tag2);

    }

    return 0;
}