LightOJ 1017 - Brush (III) （dp）

题意:

$有N \leq 100个污点,每个污点有相应的坐标(x_i, y_i), |x_i|, |y_i| \leq 10^9。现在有一个宽度为w \leq 10^4的刷子$
$刷子可以使用k \leq 100次,刷整个x轴, 问最多可以刷掉多少个污点？$

分析:

$由于坐标很大先map离散化一下, 状态很显然$
$dp[i][j]:= 当前考虑到第i个y坐标, 使用了j次刷子能刷的最多的污点数$
$转移就是涂和不涂, 涂转移到dp[p][j+1], 不涂把上一次的状态转移过来dp[i][j]=max(dp[i][j], dp[i-1][j])$
$求p的二分就好了, 预处理一下前缀和每次可以算出能涂多少个$
$答案是max_{i=1}^n\{dp[i][k]\}$
代码:

//
//  Created by TaoSama on 2015-10-28
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, w, k, a[105], sum[105], cnt[105];
int dp[105][105];

void getMax(int &x, int y) {x = max(x, y);}

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    int t; scanf("%d", &t);
    int kase = 0;
    while(t--) {
        map<int, int> mp;
        scanf("%d%d%d", &n, &w, &k);
        for(int i = 1; i <= n; ++i) {
            int x, y; scanf("%d%d", &x, &y);
            ++mp[y];
        }
        n = mp.size();
        map<int, int>::iterator iter = mp.begin();
        for(int i = 1; i <= n; ++i, ++iter) {
            a[i] = iter->first;
            sum[i] = sum[i - 1] + iter->second;
        }
        int ans = 0;
        memset(dp, 0, sizeof dp);
        for(int i = 1; i <= n; ++i) {
            for(int j = 0; j < k; ++j) {
                int p = upper_bound(a + 1, a + 1 + n, a[i] + w) - a - 1;
                getMax(dp[p][j + 1], dp[i - 1][j] + sum[p] - sum[i - 1]);
                getMax(dp[i][j], dp[i - 1][j]);
            }
            getMax(ans, dp[i][k]);
        }
        printf("Case %d: %d\n", ++kase, ans);
    }
    return 0;
}