Damn Couples ZOJ - 3161

考虑一串相邻的关系
设f[i]为有i个人的时候最多剩下的人
那么转移就为 f[ i ] = max( f[ i ] , min ( f[ i-j ] + f[ j-1 ] , f[ i-j-1 ] + f[ j ])( j< i )
右边的min表示两个人其中一个人走掉的最坏情况

然后把关系分成一段段连续的处理就行了
需要注意给出的序号并不是有序的

这是我自己的写法
把连续的一段减少的算出来并减去

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ansn() printf("%d\n",ans)
#define lansn() printf("%lld\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp(aa,bb) make_pair(aa,bb)
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
//const ll mod = 1000000007 ;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
//const ll infl = 100000000000000000;//1e17
const int maxn=  1e5+20;
const int maxm = 1e5+20;
//muv[i]=(p-(p/i))*muv[p%i]%p;
int in(int &ret) {
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}

int f[maxn];
int main() {
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL

    f[0] =0 ,  f[1] = f[2] = f[3] = 1;
    for(int i=4; i<=500; ++i) {
        int mx = - inf;
        for(int j=1; j<i; ++j) {
            mx = max(mx,min(f[j-1]+f[i-j],f[j] + f[i-j-1]));
        }
        f[i] = mx;
    }
    int n,m;
    while(~sdd(n,m)) {
        int ans = n;
        vector<pii>v;
        while(m--) {
            int l,r;
            sdd(l,r);
            if(l>r)swap(l,r);
            if(r-1==l)v.pb(mp(l,r));
        }
        sort(all(v));
        int sz = v.size();
        r0(i,sz) {
            int l = v[i].X ,r = v[i].Y;
            int lt = r;
            bool cal = 0;
            for(int j=i+1; j<sz; ++j) {
                int ll = v[j].X,rr = v[j].Y;
                if(ll!=lt) {
                    int len = lt - l+1;
                    ans -= (len - f[len]);
                    i = j-1;
                    cal = 1;
                    break;
                } else lt = rr;
            }
            if(!cal) {
                int len = v[sz-1].Y - l + 1;
                ans -= (len - f[len]);
                break;
            }
        }
        ansn();
    }
    return 0;
}

这是别人的写法
算出每种长度的块数加起来

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ansn() printf("%d\n",ans)
#define lansn() printf("%lld\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp(aa,bb) make_pair(aa,bb)
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
//const ll mod = 1000000007 ;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
//const ll infl = 100000000000000000;//1e17
const int maxn=  1e5+20;
const int maxm = 1e3+20;
//muv[i]=(p-(p/i))*muv[p%i]%p;
int in(int &ret) {
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}

int f[maxm];
bool a[maxm];
int cnt[maxm];
int main() {
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL

    f[0] =0 ,  f[1] =1 ;
    for(int i=2; i<=500; ++i) {
        for(int j=1; j<i; ++j) {
            f[i] = max(f[i],min(f[j-1]+f[i-j],f[j] + f[i-j-1]));
        }
    }
    int n,m;
    while(~sdd(n,m)) {
        r1(i,n)a[i] = 0,cnt[i] = 0;
        while(m--) {
            int l,r;
            sdd(l,r);
            if(l>r)swap(l,r);
            ++l,++r;
            if(r-1==l)
                a[l] = 1;
        }
        int len = 1;
        r1(i,n)
        {
            if(!a[i])cnt[len]++,len = 0;
            len++;
        }
        int ans = 0;
        r1(i,n)ans += cnt[i]*f[i];
        ansn();
    }
    return 0;
}