终于AC了

#include<iostream>
#include<cmath>
using namespace std;
int Max[110][21],Min[110][21],a[2],n=2;
void ST_RMQ(){
    for(int j=1;j<=20;j++)
        for(int i=1;i+(1<<j)-1<=n;i++)
            Max[i][j]=max(Max[i][j-1],Max[i+(1<<(j-1))][j-1]),
            Min[i][j]=min(Min[i][j-1],Min[i+(1<<(j-1))][j-1]);
}
int querymax(int l,int r){
    int k=log(r-l+1)/log(2);
    return max(Max[l][k],Max[r-(1<<k)+1][k]);
}
int querymin(int l,int r){
    int k=log(r-l+1)/log(2);
    return min(Min[l][k],Min[r-(1<<k)+1][k]);
}
int main(){
    scanf("%d%d",a,a+1);
    *Max[1]=*Min[1]=*a;
    *Max[2]=*Min[2]=a[1];
    ST_RMQ();
    printf("%d",querymin(1,2)+querymax(1,2));
}