求助30分

#include<iostream>
using namespace std;

int a[100010];
int pre[100010];

int log2(int x){
    if(x < 2)return 0;
    return log2(x/2)+1;
}

int addcnt(int x){
    int v = log2(x);
    int base = 1;
    for(int i=1;i<=v+1;i++)base *= 2;
    int q = base - x;
    if(q%v == 0)return q/v;
    else return q/v+1;
}


int main(){
    int n,m;cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=m;i++){
        int l,r;cin>>l>>r;
        pre[l]++;pre[r+1]--;
    }
    int op=0;
    for(int i=1;i<=n;i++){
        op+=pre[i];int q = op;
        if(a[i] < 2)continue;
        int c = addcnt(a[i]);//给log(a[i])++的代价
        while(q >= c){
            q-=c;
            a[i] = a[i]+log2(a[i])*c;
            c = addcnt(a[i]);
        }
        a[i] = a[i]+log2(a[i])*q;
        cout<<a[i]<<" ";
    }
    return 0;
}