Uva-11059 Maximum Product

#include <bits/stdc++.h>
#define _for(i,a,b) for(int i = (a);i < (b);i ++)
using namespace std;

int readint()
{int tmp;scanf("%d",&tmp);return tmp;}

int main()
{
    int n,kase = 1;
    while(~scanf("%d",&n))
    {
        vector<int> v;
        while(n --)
            v.push_back(readint());
        
        long long rnt = -393939;
        _for(i,0,v.size())
            _for(j,i,v.size())
            {
                long long int trnt = 1;
                _for(k,i,j+1)
                {
                    trnt *= v[k];
                    if(trnt>rnt)
                        rnt = trnt;
                }
            }
        if(rnt<0)
            rnt = 0;
        printf("Case #%d: The maximum product is %lld.

",kase ++,rnt);
    }
    return 0;
}

又是一道PE题，佛了