POJ2796 对拍程序

两个程序，一个AC一个WA，对拍暂时检查不出错误

 

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <ctype.h>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <stack>
#include <time.h> 

using namespace std;

long long ans1,ans1l,ans1r,ans2,ans2l,ans2r;

const long long maxSize=100000;
int ll[200000], r2[200000];
long long aa[200000], sum[200000];
int mainOK()
{
    int n, i, ll2, rr;
    long long  ans, max1=-1;
    
	freopen("a.txt","r",stdin);
    scanf("%d",&n);
    sum[0]=0;
    for(i=1;i<=n;i++)
    {
        scanf("%d",&aa[i]);
        ll[i]=r2[i]=i;
        sum[i]=sum[i-1]+aa[i];
    }
    for(i=1;i<=n;i++)
    {
        while(ll[i]>1&&aa[ll[i]-1]>=aa[i])
        {
            ll[i]=ll[ll[i]-1];
        }
    }
    for(i=n;i>=1;i--)
    {
        while(r2[i]<n&&aa[r2[i]+1]>=aa[i])
        {
            r2[i]=r2[r2[i]+1];
        }
    }
    for(i=1;i<=n;i++)
    {
        ans=(sum[r2[i]]-sum[ll[i]-1])*aa[i];
        if(max1<=ans)
        {
            max1=ans;
            ll2=ll[i];
            rr=r2[i];
        }
    }
    //printf("%lld\n%d %d\n",max1,ll2,rr);
    ans1=max1;
    ans1l=ll2;
    ans1r=rr;
    return 0;
}



 
struct node
{
	long long i,w;
};
 

long long n,ans=0,l,r;
long long a[maxSize+5];
stack <node> s;
 
int main2()
{
	int i;
	node n1,n2;
	
	freopen("a.txt","r",stdin);
	scanf("%lld",&n);
	sum[0]=0;
	for (i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
		sum[i]=sum[i-1]+a[i];
	}
	ans=0;
	n1.i=1;		n1.w=a[1];
	s.push(n1);
	for (i=2;i<=n;i++)	//枚举右边界 
	{
		n1=s.top();
		n2.i=i;		n2.w=a[i];
		if (n1.w<a[i])
			s.push(n2);
		else if (n1.w==a[i])
			continue;
		else
		{
			while (n1.w>a[i])
			{
				if (ans<(sum[i-1]-sum[n1.i-1])*n1.w)
				{
					ans=(sum[i-1]-sum[n1.i-1])*n1.w;
					l=n1.i;	r=i-1;
				}
				n2.i=n1.i;
				s.pop();
				if (s.empty())
					break;
				n1=s.top();
			}
			s.push(n2);
		}
	}
	while (!s.empty())
	{
		n1=s.top();	s.pop();
		if (ans<(sum[n]-sum[n1.i-1])*n1.w)
		{	
			ans=(sum[n]-sum[n1.i-1])*n1.w;
			l=n1.i;	r=n;
		}
	}
	//printf("%lld\n%lld %lld",ans,l,r);
	ans2=ans;
	ans2l=l;
	ans2r=r;
	return 0;
}


int MakeData()
{
	freopen("a.txt","w",stdout);
	int i,j,n,m,a[10][10],t;
	static int key=0;
	
	if(key==0)
		srand((unsigned)time(0)); 
	else
		srand(key); 
	
	n=rand()%10000+10000;
	n=100;
	printf("%d\n",n);
	for(i=0;i<n;i++)
	{
		j=rand()%100000+1;
		printf("%d ",j);
		key=rand();
	}
	fclose(stdout);
	freopen("CON","w",stdout);
}

int main()
{
	int i=0;
    while(1)
    {
		MakeData();
		
		main2();
		mainOK();
		
		i++;
		if( ans1==ans2 )
			printf("%d  OK\n",i);
		else
		{
			printf("OK ans=%lld %lld %lld\n",ans1,ans1l,ans1r);
			printf("ME ans=%lld %lld %lld\n",ans2,ans2l,ans2r);
			break;
		}
			
	}
	return 0;	
}