【HDU5875】Function(RMQ)

记录一个菜逼的成长。。

容易推导：F(l,r) = a[l] % a[l+1] % a[l+2]…% a[r];
因为模运算，所以只需找右边比当前位置的值小的数，更新位置

线段树版本

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <deque>
#include <cctype>
#include <bitset>
#include <cmath>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define cl(a) memset(a,0,sizeof(a))
#define bp __builtin_popcount
#define pb push_back
#define fin freopen("D://in.txt","r",stdin)
#define fout freopen("D://out.txt","w",stdout)
#define lson t<<1,l,mid
#define rson t<<1|1,mid+1,r
#define seglen (node[t].r-node[t].l+1)
#define pi 3.1415926
#define e  2.718281828459
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef vector<PII> VPII;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
template <typename T>
inline void read(T &x){
    T ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    x = ans;
}
inline bool DBread(double &num)
{
    char in;double Dec=0.1;
    bool IsN=false,IsD=false;
    in=getchar();
    if(in==EOF) return false;
    while(in!='-'&&in!='.'&&(in<'0'||in>'9'))
        in=getchar();
    if(in=='-'){IsN=true;num=0;}
    else if(in=='.'){IsD=true;num=0;}
    else num=in-'0';
    if(!IsD){
        while(in=getchar(),in>='0'&&in<='9'){
            num*=10;num+=in-'0';}
    }
    if(in!='.'){
        if(IsN) num=-num;
            return true;
    }else{
        while(in=getchar(),in>='0'&&in<='9'){
                num+=Dec*(in-'0');Dec*=0.1;
        }
    }
    if(IsN) num=-num;
    return true;
}
template <typename T>
inline void write(T a) {
    if(a < 0) { putchar('-'); a = -a; }
    if(a >= 10) write(a / 10);
    putchar(a % 10 + '0');
}
/******************head***********************/
const int maxn = 100000 + 10;
struct Node{
    int l,r,f;
}node[maxn << 2];
int a[maxn];
int n,m,pos,ret;
int ans;
void pushup( int t )
{
    node[t].f = min(node[t<<1].f,node[t<<1|1].f);
}
void build( int t,int l,int r)
{
    node[t].l = l;
    node[t].r = r;
    if(l == r){
        node[t].f = a[l];
        return ;
    }
    int mid = (l + r) >> 1;
    build(lson);
    build(rson);
    pushup(t);
}
void find_pos(int t,int num)//已经找到了比num小的数，更新位置
{
    if(node[t].l == node[t].r){
        pos = node[t].l;
        ret = a[node[t].l];
        return ;
    }
    if(node[t<<1].f <= num)find_pos(t<<1,num);if(ret != -1)return ;
    else find_pos(t<<1|1,num);if(ret != -1)return ;
}
void query(int t,int l,int r,int num)
{
    if(l <= node[t].l && node[t].r <= r){
        if(node[t].f > num)return ;
        find_pos(t,num); return ;
    }
    int mid = (node[t].l + node[t].r) >> 1;
    if(l <= mid)query(t<<1,l,r,num);if(ret != -1)return ;
    if(r > mid)query(t<<1|1,l,r,num);if(ret != -1)return ;
}
int main()
{
    int T;scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for( int i = 1; i <= n; i++ ){
            read(a[i]);
        }
        build(1,1,n);
        scanf("%d",&m);
        while(m--){
            int l,r;
            scanf("%d%d",&l,&r);
            ans = a[l];pos = l;
            while(ans && pos != r){
                ret = -1;
                query(1,pos+1,r,ans);
                if(ret == -1)break;
                ans %= ret;
            }
            printf("%d\n",ans);
        }
    }
    return 0;
}

ST算法 + 二分区间

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <deque>
#include <cctype>
#include <bitset>
#include <cmath>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define cl(a) memset(a,0,sizeof(a))
#define bp __builtin_popcount
#define pb push_back
#define fin freopen("D://in.txt","r",stdin)
#define fout freopen("D://out.txt","w",stdout)
#define lson t<<1,l,mid
#define rson t<<1|1,mid+1,r
#define seglen (node[t].r-node[t].l+1)
#define pi 3.1415926
#define e  2.718281828459
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef vector<PII> VPII;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
template <typename T>
inline void read(T &x){
    T ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    x = ans;
}
inline bool DBread(double &num)
{
    char in;double Dec=0.1;
    bool IsN=false,IsD=false;
    in=getchar();
    if(in==EOF) return false;
    while(in!='-'&&in!='.'&&(in<'0'||in>'9'))
        in=getchar();
    if(in=='-'){IsN=true;num=0;}
    else if(in=='.'){IsD=true;num=0;}
    else num=in-'0';
    if(!IsD){
        while(in=getchar(),in>='0'&&in<='9'){
            num*=10;num+=in-'0';}
    }
    if(in!='.'){
        if(IsN) num=-num;
            return true;
    }else{
        while(in=getchar(),in>='0'&&in<='9'){
                num+=Dec*(in-'0');Dec*=0.1;
        }
    }
    if(IsN) num=-num;
    return true;
}
template <typename T>
inline void write(T a) {
    if(a < 0) { putchar('-'); a = -a; }
    if(a >= 10) write(a / 10);
    putchar(a % 10 + '0');
}
/******************head***********************/
const int maxn = 100000 + 10;
int a[maxn];
int dp[maxn][27];
int n,m;
void build()
{
    for( int i = 0; i < n; i++ )
        dp[i][0] = a[i];
    for( int j = 1; (1 << j) <= n; j++ ){
        for( int i = 0; i + (1 << j) - 1 < n; i++ ){
            dp[i][j] = min(dp[i][j - 1],dp[i + (1 << (j - 1))][j - 1]);
        }
    }
}
int query(int l,int r)
{
    int w = r - l + 1;
    int x = 0;
    while((1 << (x+1)) <= w)x++;
    return min(dp[l][x],dp[r-(1<<x)+1][x]);
}
int solve(int l,int r)
{
    l--;r--;
    if(l == r)return dp[l][0];
    int ret = a[l];
    l++;
    while(l <= r){
        int tl = l,tr = r;
        while(tl < tr){
            int mid = (tl + tr) >> 1;
            if(query(tl,mid) <= ret)tr = mid;
            else if(query(mid+1,tr) <= ret)tl = mid + 1;
            else return ret;
        }
        ret %= a[tl];
        l = tl + 1;
    }
    return ret;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for( int i = 0; i < n; i++ )scanf("%d",a+i);
        build();
        scanf("%d",&m);
        while(m--){
            int l,r;
            scanf("%d%d",&l,&r);
            printf("%d\n",solve(l,r));
        }
    }
    return 0;
}