codeforces 528B B. Photo to Remember(rmq)

题目链接：

codeforces 528B

---

题目大意：

给出一列数，求整个序列刨去某个数之后的区间和与该区间的最大值的乘积。

---

题目分析：

最大值用rmq处理出来，求出前缀和和后缀和即可，水题

---

AC代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#define MAX 200007

using namespace std;

int n;
int w[MAX];
int h[MAX];
int lsum[MAX];
int rsum[MAX];
int dp[MAX][23];

void init ( )
{
    for ( int i = 1 ; i <= n ; i++ )
        dp[i][0] = h[i];
    for ( int j = 1 ; (1<<j) <= n ; j++ )
        for ( int i = 1 ; i+(1<<j)-1 <= n ; i++ )
            dp[i][j] = max ( dp[i][j-1] , dp[i+(1<<(j-1))][j-1] );
    lsum[0] = rsum[n+1] = 0;
    for ( int i = 1 ; i <= n ; i++ )
        lsum[i] = lsum[i-1] + w[i];
    for ( int i = n ; i >= 1 ; i-- )
        rsum[i] = rsum[i+1] + w[i];
}

int query ( int l , int r )
{
    int k = (int)((log(r-l+1)*1.0)/log(2.0));
    return max ( dp[l][k] , dp[r-(1<<k)+1][k] );
}

int main ( )
{
    while ( ~scanf ( "%d" , &n ) )
    {
        for ( int i = 1 ; i <= n ; i++ )
            scanf ( "%d%d" , &w[i] , &h[i] );
        init ();
        //cout << query ( 1 , 2 ) << " " << query ( 2 , 3 ) << endl;
        printf ( "%d" , rsum[2]*query(2,n) );
        for ( int i = 2 ; i <= n ; i++ )
        {
            int x = query(1 , i-1 );
            if ( i != n )
                x = max ( x , query ( i+1 , n ));
            printf ( " %d" , (lsum[i-1] + rsum[i+1])*x );
        }
        puts ( "");
    }
}