【codeforces】660F. Bear and Bowling 4【分治+维护凸壳】

题目链接：【codeforces】660F. Bear and Bowling 4

题目大意：给一个长度为$n$的序列，第$i$个数为$a_i$选取其中一个连续子序列$\{a_x,a_{x+1},...,a_{x+k-1}\}$，使得$\sum_{i=1}^k i\cdot a_{x+i-1}$ 最大。
题目分析：考虑对序列分治，每次选取当前整个序列的中点，然后以左半部分每个下标为x，右边则可以表示成$kx+b$的形式，因此可以对右边的直线维护一个下凸壳。
复杂度$O(nlog^2n)$，如果用归并排序代替快排，可以做到$O(nlogn)$

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std ;

typedef long long LL ;

#define clr( a , x ) memset ( a , x , sizeof a )

const int MAXN = 200005 ;

struct Line {
    LL k , b ;
    Line () {}
    Line ( LL k , LL b ) : k ( k ) , b ( b ) {}
    bool operator < ( const Line& a ) const {
        return k != a.k ? k < a.k : b < a.b ;
    }
    LL f ( int x ) {
        return k * x + b ;
    }
} ;

Line a[MAXN] ;
LL sum[MAXN] ;
LL val[MAXN] ;
int S[MAXN] ;
LL ans ;
int n ;

int check ( int i , int j , int k ) {
    return ( double ) ( a[i].b - a[j].b ) / ( a[j].k - a[i].k ) >= ( double ) ( a[i].b - a[k].b ) / ( a[k].k - a[i].k ) ;
}

void dfs ( int l , int r ) {
    if ( l == r ) return ;
    int m = l + r >> 1 ;
    dfs ( l , m ) ;
    dfs ( m + 1 , r ) ;
    int cnt = 0 , t = 0 ;
    LL tot = 0 ;
    for ( int i = m + 1 ; i <= r ; ++ i ) {
        tot += ( i - m ) * val[i] ;
        a[++ cnt] = Line ( sum[i] - sum[m] , tot ) ;
    }
    sort ( a + 1 , a + cnt + 1 ) ;
    for ( int i = 1 ; i <= cnt ; ++ i ) {
        while ( t && a[S[t]].k == a[i].k || t > 1 && check ( S[t - 1] , S[t] , i ) ) -- t ;
        S[++ t] = i ;
    }
    tot = 0 ;
    for ( int i = m , j = 1 , k = 1 ; i >= l ; -- i , ++ j ) {
        tot += sum[m] - sum[i - 1] ;
        while ( k < t && a[S[k]].f ( j ) < a[S[k + 1]].f ( j ) ) ++ k ;
        ans = max ( ans , tot + a[S[k]].f ( j ) ) ;
    }
}

void solve () {
    ans = 0 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        scanf ( "%lld" , &val[i] ) ;
        sum[i] = sum[i - 1] + val[i] ;
        ans = max ( ans , val[i] ) ;
    }
    dfs ( 1 , n ) ;
    printf ( "%lld\n" , ans ) ;
}

int main () {
    while ( ~scanf ( "%d" , &n ) ) solve () ;
    return 0 ;
}

这是归并排序的代码，然而没有什么效率的提升。

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std ;

typedef long long LL ;

#define clr( a , x ) memset ( a , x , sizeof a )

const int MAXN = 200005 ;

struct Line {
    LL k , b ;
    Line () {}
    Line ( LL k , LL b ) : k ( k ) , b ( b ) {}
    bool operator < ( const Line& a ) const {
        return k != a.k ? k < a.k : b < a.b ;
    }
    LL f ( int x ) {
        return k * x + b ;
    }
} ;

Line a[MAXN] ;
LL sum[MAXN] ;
LL val[MAXN] ;
LL tot[MAXN] ;
int id[MAXN] ;
int S[MAXN] ;
LL ans ;
int n ;

int check ( int i , int j , int k ) {
    return ( double ) ( a[i].b - a[j].b ) / ( a[j].k - a[i].k ) >= ( double ) ( a[i].b - a[k].b ) / ( a[k].k - a[i].k ) ;
}

void merge ( int a[] , int n , int b[] , int m ) {
    static int c[MAXN] ;
    int i = 0 , j = 0 , k = 0 , t = 0 ;
    while ( i < n && j < m ) c[k ++] = sum[a[i]] < sum[b[j]] ? a[i ++] : b[j ++] ;
    while ( i < n ) c[k ++] = a[i ++] ;
    while ( j < m ) c[k ++] = b[j ++] ;
    while ( t < n + m ) a[t] = c[t] , t ++ ;
}

void dfs ( int l , int r ) {
    if ( l == r ) return ;
    int m = l + r >> 1 ;
    dfs ( l , m ) ;
    dfs ( m + 1 , r ) ;
    int cnt = 0 , t = 0 ;
    tot[m] = 0 ;
    for ( int i = m + 1 ; i <= r ; ++ i ) {
        tot[i] = tot[i - 1] + ( i - m ) * val[i] ;
    }
    for ( int i = m + 1 ; i <= r ; ++ i ) {
        a[++ cnt] = Line ( sum[id[i]] - sum[m] , tot[id[i]] ) ;
    }
    for ( int i = 1 ; i <= cnt ; ++ i ) {
        while ( t && a[S[t]].k == a[i].k && a[S[t]].b < a[i].b ) -- t ;
        while ( t > 1 && check ( S[t - 1] , S[t] , i ) ) -- t ;
        S[++ t] = i ;
    }
    LL res = 0 ;
    for ( int i = m , j = 1 , k = 1 ; i >= l ; -- i , ++ j ) {
        res += sum[m] - sum[i - 1] ;
        while ( k < t && a[S[k]].f ( j ) < a[S[k + 1]].f ( j ) ) ++ k ;
        ans = max ( ans , res + a[S[k]].f ( j ) ) ;
    }
    merge ( id + l , m - l + 1 , id + m + 1 , r - m ) ;
}

void solve () {
    ans = 0 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        scanf ( "%lld" , &val[i] ) ;
        sum[i] = sum[i - 1] + val[i] ;
        ans = max ( ans , val[i] ) ;
        id[i] = i ;
    }
    dfs ( 1 , n ) ;
    printf ( "%lld\n" , ans ) ;
}

int main () {
    while ( ~scanf ( "%d" , &n ) ) solve () ;
    return 0 ;
}

压缩后代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define clr(a,x) memset(a,x,sizeof a)
const int MAXN=200005;
struct Line{
    LL k,b;
    Line(){}
    Line(LL k,LL b):k(k),b(b){}
    bool operator <(const Line&a)const{return k!=a.k?k<a.k:b<a.b;}
    LL f(int x){return k*x+b;}
}a[MAXN];
LL sum[MAXN],val[MAXN],tot[MAXN],ans;
int id[MAXN],S[MAXN],n;
int check(int i,int j,int k){
    return(double)(a[i].b-a[j].b)/(a[j].k-a[i].k)>=(double)(a[i].b-a[k].b)/(a[k].k-a[i].k);
}
void merge(int a[],int n,int b[],int m){
    static int c[MAXN];
    int i=0,j=0,k=0,t=0;
    while(i<n&&j<m)c[k++]=sum[a[i]]<sum[b[j]]?a[i++]:b[j++];
    while(i<n)c[k++]=a[i++];
    while(j<m)c[k++]=b[j++];
    while(t<n+m)a[t]=c[t],t++;
}
void dfs(int l,int r){
    if(l==r)return;
    int m=l+r>>1;
    dfs(l,m);
    dfs(m+1,r);
    int cnt=0,t=0;
    tot[m]=0;
    for(int i=m+1;i<=r;++i)tot[i]=tot[i-1]+(i-m)*val[i];
    for(int i=m+1;i<=r;++i)a[++cnt]=Line(sum[id[i]]-sum[m],tot[id[i]]);
    for(int i=1;i<=cnt;S[++t]=i++){
        while(t&&a[S[t]].k==a[i].k&&a[S[t]].b<a[i].b)--t;
        while(t>1&&check(S[t-1],S[t],i))--t;
    }
    LL res=0;
    for(int i=m,j=1,k=1;i>=l;--i,++j){
        res+=sum[m]-sum[i-1];
        while(k<t&&a[S[k]].f(j)<a[S[k+1]].f(j))++k;
        ans=max(ans,res+a[S[k]].f(j));
    }
    merge(id+l,m-l+1,id+m+1,r-m);
}
void solve(){
    ans=0;
    for(int i=1;i<=n;++i){
        scanf("%lld",&val[i]);
        sum[i]=sum[i-1]+val[i];
        ans=max(ans,val[i]);
        id[i]=i;
    }
    dfs(1,n);
    printf("%lld\n",ans);
}
int main(){
    while(~scanf("%d",&n))solve();
    return 0;
}