[代码]codeforces 150c Smart Cheater

Abstract

codeforces 150c Smart Cheater

线段树 概率

Source

http://codeforces.com/problemset/problem/150/C

Solution

一开始没读懂题，以为是选一个区间，然后这个区间的所有人都不买票……

读明白的话，就是个区间求最大子段和的题目。用线段树做就好了。

之前没写过hotel那一类的题，所以写起来很费劲。果然线段树是需要深入理解和灵活运用的啊……

Code

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define L(x) (x<<1)
#define R(x) (x<<1|1)
#define M(x) (x>>1)

typedef long long ll;
ll a[555555];

struct snode {
    int l, r;
    ll f, fl, fr, s;
    snode() {f = fl = fr = s = 0;}
    snode(ll a, ll b, ll c, ll d): f(a), fl(b), fr(c), s(d) {}
}st[555555<<2];

void pushup(int n) {
    st[n].s = st[L(n)].s+st[R(n)].s;
    st[n].fl = max(st[L(n)].fl, st[L(n)].s+st[R(n)].fl);
    st[n].fr = max(st[R(n)].fr, st[R(n)].s+st[L(n)].fr);
    ll &res = st[n].f;
    res = max(res, st[L(n)].f);
    res = max(res, st[R(n)].f);
    res = max(res, st[L(n)].fr+st[R(n)].fl);
}

void build(int l, int r, int n) {
    st[n].l = l; st[n].r = r;
    if (l==r) {
        st[n].s = a[l];
        st[n].f = st[n].fl = st[n].fr = max(a[l], 0ll);
        return;
    }
    int m = M(l+r);
    build(l, m, L(n));
    build(m+1, r, R(n));
    pushup(n);
}

snode query(int l, int r, int n) {
    if (l<=st[n].l && r>=st[n].r) return st[n];
    int m = M(st[n].l+st[n].r);
    snode ln, rn, res;
    if (l<=m) ln = query(l, r, L(n));
    if (r>m) rn = query(l, r, R(n));
    res.s = ln.s+rn.s;
    res.fl = max(ln.fl, ln.s+rn.fl);
    res.fr = max(rn.fr, rn.s+ln.fr);
    res.f = max(ln.f, rn.f);
    if (l<=m && r>m) res.f = max(res.f, ln.fr+rn.fl);
    return res;
}

int N, M, C;
int x[555555];
int p[555555];

int main() {
    int i, j, k;
    int t = 0;
    while (cin>>N>>M>>C) {
        ++t;
        for (i = 0; i < N; ++i)
            scanf("%d", x+i);
        for (i = 1; i < N; ++i) {
            scanf("%d", p+i);
            a[i] = (x[i]-x[i-1])*50ll-1ll*p[i]*C;
        }
        build(1, N-1, 1);
        ll ans = 0;
        while (M--) {
            scanf("%d%d", &i, &j);
            ans += query(i, j-1, 1).f;
        }
        printf("%.10f\n", ans*0.01);
    }
    return 0;
}

转载于:https://www.cnblogs.com/jffifa/archive/2012/10/26/2741296.html