zstu 2107 Largest Rectangle in a Histogram

 for(int i=2;i<=n;i++)
 {
     if(height[i-1]<height[i])
         node[i].left=0;
     else
     {
         int k=i-1;
         while(height[k]>=height[i]&&k>1)
         {
             k--;
         }
         node[i].left=i-k;
     }             
}

int height[100010]; 
for(int i=1;i<=n;i++) 
{ 
    scanf("%d",&height[i]); 
} 
for(int i=1;i<=n;i++) 
{ 
    long long test=(fabs(node[i].right-node[i].left)+1)*height[i]; //         abs   。。
    ans=max(ans,test); 
} 

#include<stdio.h>
#include<math.h>
long long max(long long g,long long h)
{
    return g>h?g:h;
}
struct nodes
{
    int left;
    int right;
}node[100010];
long long height[100010];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)
            break;
        for(int i=1;i<=n;i++)
        {
            scanf("%lld",&height[i]);
            node[i].left=i;
            node[i].right=i;
        }
        height[0]=-1;
        height[n+1]=-1;
        for(int i=1;i<=n;i++)
        {
            while(height[i]<=height[node[i].left-1])
            {
                node[i].left=node[node[i].left-1].left;
            }
        }
        for(int i=n;i>=1;i--)
        {
            while(height[i]<=height[node[i].right+1])
            {
                node[i].right=node[node[i].right+1].right;
            }
        }
        long long ans=0;
        for(int i=1;i<=n;i++)
        {
            long long test=(node[i].right-node[i].left+1)*height[i];
            ans=max(ans,test);
        }
        printf("%lld
",ans);
    }
    return 0;
}