【TYVJ】P1038 忠诚

【算法】线段树

#include<cstdio>
#include<algorithm>
using namespace std;
struct treess{int l,r,ms;}t[];
const int maxn=,inf=0x3f3f3f3f;
int a[maxn],n,m;
void build(int k,int l,int r)
{
    t[k].l=l;t[k].r=r;
    if(l==r){t[k].ms=a[l];return;}
    int mid=(l+r)>>;
    build(k<<,l,mid);
    build(k<<|,mid+,r);
    t[k].ms=min(t[k<<].ms,t[k<<|].ms);
//    printf("[%d] l=%d r=%d ms=%d",k,t[k].l,t[k].r,t[k].ms);
}
int ask(int k,int l,int r)
{
    int left=t[k].l,right=t[k].r,ans=inf;
    if(l<=left&&r>=right)return t[k].ms;
     else
      {
        int mid=(left+right)>>;
        if(l<=mid)ans=min(ans,ask(k<<,l,r));
        if(r>mid)ans=min(ans,ask(k<<|,l,r));
      }
    return ans;
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=;i<=n;i++)scanf("%d",&a[i]);
    build(,,n);
    int nowl,nowr;
    for(int i=;i<m;i++)
     {
         scanf("%d%d",&nowl,&nowr);
         printf("%d ",ask(,nowl,nowr));
     }
    scanf("%d%d",&nowl,&nowr);
    printf("%d",ask(,nowl,nowr));
    return ;
}