BZOJ 1012: [JSOI2008]最大数maxnumber 单调队列/线段树

题目链接:

http://www.lydsy.com/JudgeOnline/problem.php?id=1012

题意:

题解:

不用printf输出就RE…

代码:

代码一： 单调队列

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
//////////////////////////////////////////////////////////////////////////
const int maxn = 250001;

int a[maxn],maxnum[maxn];

int main(){
    int m,d,k=0;
    int t = 0;
    scanf("%d%d",&m,&d);
    for(int i=0; i<m; i++){
        char op[2]; scanf("%s",op);
        if(op[0] == 'A'){
            int x; scanf("%d",&x);
            a[++t] = (x+k)%d;
            for(int i=t; i>0; i--){
                if(maxnum[i] < a[t]){
                    maxnum[i] = a[t];
                }else{
                    break;
                }
            }
        }else{
            int x; scanf("%d",&x);
            k = maxnum[t-x+1];
            printf("%d\n",k);
        }
    }

    return 0;
}

代码二：线段树

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
//////////////////////////////////////////////////////////////////////////
const int maxn = 2e5+10;

int n;ll d;
struct node{
    int l,r;
    ll mx;
    void update(ll val){
        mx = max(mx,val);
    }
}tree[maxn*4];

void pushup(int rt){
    tree[rt].mx = max(tree[rt<<1].mx,tree[rt<<1|1].mx);
}

void build(int rt,int l,int r){
    tree[rt].l=l,tree[rt].r = r;
    tree[rt].mx = 0;
    if(l == r)
        return ;
    int mid = (l+r)/2;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    pushup(rt);
}

void update(int rt,int pos,ll val){
    int L = tree[rt].l, R = tree[rt].r;
    if(L==R && L==pos){
        tree[rt].mx = val;
        return ;
    }
    int mid = (L+R)/2;
    if(pos<=mid) update(rt<<1,pos,val);
    if(pos>mid) update(rt<<1|1,pos,val);
    pushup(rt);
}

ll query(int rt,int l,int r){
    int L = tree[rt].l, R = tree[rt].r;
    if(l<=L && R<=r)
        return tree[rt].mx;
    ll ans = 0;
    int mid = (L+R)/2;
    if(l<=mid) ans = max(ans,query(rt<<1,l,r));
    if(r>mid) ans = max(ans,query(rt<<1|1,l,r));
    return ans;
}

int main(){
    scanf("%d%lld",&n,&d);
    build(1,1,n);
    ll ans = 0,v;
    int cnt = 0;
    for(int i=0; i<n; i++){
        char op;
        scanf(" %c%lld",&op,&v);
        if(op == 'A'){
            v = (ans+v)%d;
            ++cnt;
            update(1,cnt,v);
        }else{
            ans = query(1,cnt-v+1,cnt);
            printf("%lld\n",ans);
        }
    }

    return 0;
}