【HDOJ】4122 Alice's mooncake shop

RMQ的基础题目，简单题。

/* 4122 */
#include <iostream>
#include <sstream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <deque>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <cctype>
#include <cassert>
#include <functional>
#include <iterator>
#include <iomanip>
using namespace std;
//#pragma comment(linker,"/STACK:102400000,1024000")

#define sti                set<int>
#define stpii            set<pair<int, int> >
#define mpii            map<int,int>
#define vi                vector<int>
#define pii                pair<int,int>
#define vpii            vector<pair<int,int> >
#define rep(i, a, n)     for (int i=a;i<n;++i)
#define per(i, a, n)     for (int i=n-1;i>=a;--i)
#define clr                clear
#define pb                 push_back
#define mp                 make_pair
#define fir                first
#define sec                second
#define all(x)             (x).begin(),(x).end()
#define SZ(x)             ((int)(x).size())
#define lson            l, mid, rt<<1
#define rson            mid+1, r, rt<<1|1

const int maxm = 1e5+5;
const int maxn = 2505;
int T[maxn], N[maxn];
int cost[maxm], val[maxm];
int dp[maxm][17];
int days[12] = {
    31, 28, 31, 30, 31, 30, 
    31, 31, 30, 31, 30, 31
};
int days_[12] = {
    31, 29, 31, 30, 31, 30, 
    31, 31, 30, 31, 30, 31
};
char month[12][4] = {
    "Jan", "Feb", "Mar", "Apr", 
    "May", "Jun", "Jul", "Aug", 
    "Sep", "Oct", "Nov", "Dec"
};
char s[12];
int yy, mm, dd, hh;
int n, m;

int getMon(char *s) {
    rep(i, 0, 12)
        if (strcmp(month[i], s) == 0)
            return i;
        
    return -1;
}

bool isLeapYear(int y) {
    return y%400==0 || (y%100!=0 && y%4==0);
}

int getTime() {
    mm = getMon(s);
    int ret = 0;
    
    rep(i, 2000, yy) {
        if (isLeapYear(i))
            ret += 366;
        else
            ret += 365;
    }
    if (isLeapYear(yy)) {
        rep(i, 0, mm)
            ret += days_[i];
    } else {
        rep(i, 0, mm)
            ret += days[i];
    }
    ret += dd-1;
    ret *= 24;
    ret += hh + 1;
    
    return ret;
}

void init_RMQ() {
    int i, j;
    
    for (i=0; i<m; ++i)
        dp[i][0] = i;
        
    for (j=1; (1<<j)<=m; ++j) {
        for (i=0; i+(1<<j)-1<m; ++i) {
            if (val[dp[i][j-1]] < val[dp[i+(1<<(j-1))][j-1]])
                dp[i][j] = dp[i][j-1];
            else
                dp[i][j] = dp[i+(1<<(j-1))][j-1];
        }
    }
}

int RMQ(int l, int r) {
    if (l < 0)
        l = 0;
    
    int k = 0;
    
    while (1<<(k+1) <= r-l+1)
        ++k;
    
    if (val[dp[l][k]] < val[dp[r-(1<<k)+1][k]])
        return dp[l][k];
    else
        return dp[r-(1<<k)+1][k];
}

int main() {
    ios::sync_with_stdio(false);
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
        freopen("data.out", "w", stdout);
    #endif
    
    int st, cst;
    int idx, tmp;
    __int64 ans;
    
    while (scanf("%d%d", &n, &m)!=EOF && (n||m)) {
        rep(i, 0, n) {            
            scanf("%s%d%d%d%d", s, &dd, &yy, &hh, &N[i]);
            T[i] = getTime();
        }
        scanf("%d%d", &st, &cst);
        rep(i, 0, m) {
            scanf("%d", &cost[i]);
            val[i] = cost[i] + cst * (m - i);
        }
        
        ans = 0;
        init_RMQ();
        rep(i, 0, n) {
            idx = RMQ(T[i]-st, T[i]-1);
            tmp = cost[idx] + (T[i]-1-idx) * cst;
            ans += 1LL * tmp * N[i];
        }
        
        printf("%I64d
", ans);
    }
    
    #ifndef ONLINE_JUDGE
        printf("time = %d.
", (int)clock());
    #endif
    
    return 0;
}