POJ 2796

我傻叉啊，静态的区间求和根本就不需要用树状数组，实在是太傻叉了。

不过，还是过了，哈哈，我懒得改了，时间复杂度为O( n log(n) )

主要考察内容是单调栈,单调栈的主要作用是搜索最近的那个比他更高级或更低级的数据，

表达式求值的本质也是如此

#include <cstdio> using namespace std; const int MAX = 100010; typedef struct _Node { long long data; int left; int right; }Node; Node data[MAX]; long long stack[MAX]; int stacki; long long tree[MAX]; int treen; int getlowbit( int x ) { return x & (-x); } void setbit( int x , long long key ) { for( ; x <= treen ; x += getlowbit(x) ) tree[x] += key; } long long getbit( int x ) { long long sum = 0 ; for( ; x >= 1 ; x -= getlowbit(x) ) sum += tree[x]; return sum; } void setleftright() { stacki = 0 ; for( int i = treen ; i >= 1 ; --i ) { while( stacki != 0 && data[ stack[ stacki - 1 ] ].data > data[i].data ) data[ stack[ --stacki ] ].left = i + 1 ; stack[ stacki++ ] = i; } while( stacki != 0 ) data[ stack[ --stacki ] ].left = 1; stacki = 0 ; for( int i = 1 ; i <= treen ; ++i ) { while( stacki != 0 && data[ stack[ stacki - 1 ] ].data > data[i].data ) data[ stack[ --stacki ] ].right = i - 1 ; stack[ stacki ++ ] = i ; } while( stacki != 0 ) data[ stack[ -- stacki ] ].right = treen; } void getmax() { long long max = -1; int left; int right; long long summid; for( int i = 1 ; i <= treen ; ++i ) { summid = getbit( data[i].right ) - getbit( data[i].left - 1 ); data[i].data = summid * data[i].data; if( data[i].data > max ) { max = data[i].data; left = data[i].left; right = data[i].right ; } } //for( int i = 1 ; i <= treen ; ++i ) //if( data[i].data == max ) //printf("%lld/n%d %d/n",data[i].data,data[i].left,data[i].right); printf("%lld/n%d %d/n",max,left,right); } int main() { scanf("%d",&treen); for( int i = 1 ; i <= treen ; ++i ) { scanf("%lld",&data[i].data); setbit( i , data[i].data ); } setleftright(); getmax(); return 0; }