线段覆盖 dp

Codevs 1214 线段覆盖

贪心法：

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

const int MAXN = 1000000 + 10;
int dp[MAXN];
struct Seg{
    int l, r;
}xl[MAXN];

bool cmp(Seg a, Seg b)
{
    return a.r < b.r;
}

int main()
{
    int n, ans = 0, maxn = -1e9;
    cin >> n;
    for(int i = 1; i <= n; i ++)
    {
        int l, r;
        scanf("%d%d", &l, &r);
        xl[i].l = min(l,r); 
        xl[i].r = max(l,r);
    }
    sort(xl+1, xl+n+1, cmp);
    for(int i = 1; i <= n; i ++)
    {
        if(xl[i].l >= maxn)
        {
            ans ++;
            maxn = xl[i].r;
        }
    }
    cout << ans << endl;
    return 0;
}

dp：

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

const int MAXN = 100 + 10;
int dp[MAXN];
struct Seg{
    int l, r;
}xl[MAXN];

bool cmp(Seg a, Seg b)
{
    return a.r < b.r;
}

int main()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; i ++)
    {
        int l, r;
        scanf("%d%d", &l, &r);
        xl[i].l = min(l,r); 
        xl[i].r = max(l,r);
    }
    sort(xl+1, xl+n+1, cmp);
    for(int i = 1; i <= n; i ++)
        dp[i] = 1;
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j < i; j ++)
            if(xl[j].r <= xl[i].l)
                dp[i] = max(dp[i], dp[j]+1);
    int ans = 0;
    for(int i = 1; i <= n; i ++)
        ans = max(ans, dp[i]);
    cout << ans << endl;
    return 0;
}

/*
输入数据 (显示前20行)
6
1 30
1 2
2 3
4 5
5 6
100 200
正确答案
> 5\ No newline at end of file
*/

---

Codevs 3027 线段覆盖 2

dp：

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

const int MAXN = 1000 + 10;
int dp[MAXN];
struct Seg{
    int l, r, d;
}l[MAXN];

bool cmp(Seg a, Seg b)
{
    return a.r < b.r;
}

int main()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; i ++)
        scanf("%d%d%d", &l[i].l, &l[i].r, &l[i].d);
    sort(l+1, l+n+1, cmp);
    for(int i = 1; i <= n; i ++)
        dp[i] = l[i].d;
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j < i;j ++)
            if(l[j].r <= l[i].l)
                dp[i] = max(dp[i], dp[j] + l[i].d);
    int ans = dp[1];
    for(int i = 1; i <= n; i ++)
        ans = max(ans, dp[i]);
    cout << ans << endl;
    return 0;
}