Tyvj 1038-1039 忠诚1-2 【线段树】

题目链接：
http://www.tyvj.cn/p/1038
http://www.tyvj.cn/p/1039

题解：
都是线段树裸体，只不过1038 没有修改，1039有修改而已。
不错的模板题，建议大家做一做~

代码：
1038：

#include <cstdio>
#include <algorithm>

using namespace std;

const int size = 400005;
struct _seg {
    int l, r;
    int mn;
} seg[size];

int n, m;
int money[size];

void build(int x, int y, int num) {
    if(x == y) { scanf("%d", &seg[num].mn); return ; }

    int mid = (x+y) >> 1;
    build(x, mid, num*2);
    build(mid+1, y, num*2+1);
    seg[num].mn = min(seg[num*2].mn, seg[num*2+1].mn);
}

int u, v;
int query(int x, int y, int num) {
    if(u <= x && y <= v) return seg[num].mn;

    int mid = (x+y) >> 1;
    if(u > mid) return query(mid+1, y, 2*num+1);
    if(v <= mid) return query(x, mid, 2*num);
    return min(query(mid+1, y, 2*num+1), query(x, mid, 2*num));
}

int main() {
    scanf("%d %d", &n, &m);
    build(1, n, 1);
    for ( int i = 1; i <= m; i ++ ) {
        scanf("%d %d", &u, &v);
        int ans = query(1, n, 1);
        printf("%d ", ans);
    }
    puts("");

    return 0;
}

1039：

#include <cstdio>
#include <algorithm>

using namespace std;

const int size = 400005;
struct seg {    
    int l, r;
    int mn;
} seg[size];

int n, m;
int peop[size];
/*
void build(int k,int l,int r)
{
    ls[k]=l;rs[k]=r;
    int mid=(l+r)>>1;
    if(l==r)
    {
        scanf("%d",&val[k]);
        return;
    }
    build(k<<1,l,mid);build(k<<1|1,mid+1,r);
    val[k]=min(val[k<<1],val[k<<1|1]);
}*/

int css=0;
void build(int x, int y, int num) {
    seg[num].l = x; seg[num].r = y;
    if(x == y) {
        css ++;
        scanf("%d", &seg[num].mn);
        return ;
    }

    int mid = (x+y) >> 1;
    build(x, mid, num*2);
    build(mid+1, y, num*2+1);
    seg[num].mn = min(seg[num*2].mn, seg[num*2+1].mn);
}

void update(int x, int shou, int num) {
    int le = seg[num].l, ri = seg[num].r, mid = (le+ri) >> 1;
    if(le == ri) {
        seg[num].mn = shou;
        return ;
    }

    if(x <= mid) update(x, shou, num*2);
    else update(x, shou, num*2+1);
    seg[num].mn = min(seg[num*2].mn, seg[num*2+1].mn);
}

const int inf = 1<<26;
int query(int x, int y, int num) {
    int le = seg[num].l, ri = seg[num].r, mid = (le+ri) >> 1;
    if(le == x && ri == y) return seg[num].mn;

    int ans = inf;
    if(x <= mid) ans = min(ans, query(x, min(mid, y), num*2));
    if(y > mid) ans = min(ans, query(max(mid+1, x), y, num*2+1));

    return ans;
}

int main() {
    scanf("%d %d", &n, &m);
    build(1, n, 1);

    for ( int i = 1; i <= m; i ++ ) {
        int ord, a, b;
        scanf("%d %d %d", &ord, &a, &b);
        if(ord == 1) {
            printf("%d ", query(a, b, 1));
        } else {
            update(a, b, 1);
        }
    }

    return 0;
}