uva507 - Jill Rides Again（好题）

#include<cstdlib>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<list>
#include<queue>
#include<vector>
#define LL long long
#define UI unsigned int
#define inf 0x7fffffff
#define eps 1e-7
#define M 105
#define N 21000
using namespace std;
int m,n,t;
int a[N];
int main()
{
#ifndef ONLINE_JUDGE
    freopen("ex.in","r",stdin);
#endif
    int ncase=0;
    scanf("%d%*c",&t);
    while(t--)
    {
        scanf("%d",&n);
        for (int i=1;i<n;++i )
        	{
        	    scanf("%d",&a[i]);
        	    a[i]+=a[i-1];
        	}
        int mini=0,minv=0,x=-1,aa,bb;

        for (int i=1;i<n;++i )
        	{
        	    if(a[i]<minv)
        	    minv=a[i],mini=i;

        	    if(a[i]-minv>max(x,0)&&mini<i)
        	    x=a[i]-minv,aa=mini,bb=i;
        	    else if(a[i]-minv==max(x,0)&&mini<i)
        	    {
        	        if(bb-aa<i-mini)
                    x=a[i]-minv,aa=mini,bb=i;
//        	        else if(bb-aa==i-mini&&mini)
        	    }
        	}
        if(x<0)
        printf("Route %d has no nice parts\n",++ncase);
        else
        printf("The nicest part of route %d is between stops %d and %d\n",++ncase,aa+1,bb+1);
    }
    return 0;
}