bzoj 1283 序列

题意：给出一个长度为n的正整数序列Ci，求一个子序列，使得原序列中任意长度为m的子串中被选出的元素不超过K(K,M<=100) 个，并且选出的元素之和最大。

思路： 线性规划 费用流建图

        步骤：1.列出 所有的不等式，并将其转化为等式。

                   2.每一项和它的后一项做差分，注意 最开始需要添加 0 = 0 的项

                   3.差分后的等式一定包含每个元素 一次正的，一次负的。我们只需考虑所有负的，并将负的作为出边，连到对应为                          正的等式上。

                  4.对于y和k很好连 。

#include <bits/stdc++.h>
using namespace std;
typedef int lint;
typedef long long LL;
const int inf = 0x3f3f3f3f;
const int maxn = 2005;
struct EDGE {
    int from, to, next, cost, cap;  //  如果需要修改 cost为LL
};
namespace MFMC {
    const static int maxn = 100011;
    const static int maxm = 500005;
    EDGE edge[maxm];
    int tot, he[maxn], n;
    void init(int _n) {
        tot = 0;
        n = _n + 1;
        memset(he, -1, n * sizeof(int));
    }
    void Add(int u, int v, int cap,int cost) {   //  如果需要修改 cost为LL
        edge[tot] = EDGE{u, v, he[u], cost, cap};
        he[u] = tot++;
    }
    void add(int u, int v, int cap,int cost) {  //  如果需要修改 cost为LL
        Add(u, v,  cap,cost);
        Add(v, u,  0,-cost);
    }
//O(VE)
//record_e[i]是fa[i]->i的边的编号
    template<typename DT>
    void spfa(int s, DT dist[], int rec[]) {
        queue<int> q;
        static bool inq[maxn];

        memset(dist, 0x3f, n * sizeof(DT));
        memset(inq, 0, n * sizeof(bool));
        memset(rec, -1, n * sizeof(int));
        q.push(s);
        dist[s] = 0;
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            inq[u] = 0;
            for (int e = he[u]; ~e; e = edge[e].next) {
                if (0 == edge[e].cap)
                    continue;
                int v = edge[e].to;
                if (dist[v] > dist[u] + edge[e].cost) {
                    dist[v] = dist[u] + edge[e].cost;
                    rec[v] = e;
                    if (!inq[v]) {
                        q.push(v);
                        inq[v] = 1;
                    }
                }
            }
        }
    }

    template<typename DT>
    void dijkstra(int s, DT dist[], int rec[]) {
        priority_queue<pair<DT, int> > q;//-dist, vertex

        memset(dist, 0x3f, n * sizeof(DT));
        memset(rec, -1, n * sizeof(int));
        dist[s] = 0;
        q.push(make_pair(0, s));
        while (!q.empty()) {
            s = q.top().second;
            DT c = -q.top().first;
            q.pop();
            if (c != dist[s]) continue;
            for (int e = he[s]; ~e; e = edge[e].next) {
                if (0 == edge[e].cap) continue;
                int v = edge[e].to;
                if (dist[v] > c + edge[e].cost) {
                    dist[v] = c + edge[e].cost;
                    rec[v] = e;
                    q.push(make_pair(-dist[v], v));
                }
            }
        }
    }

//Need dijkstra_GRAPH_EDGES_PQ
//O(FE log(E)),F is the maximum flow

    template<typename FT, typename CT>
    void mfmc(int s, int t, FT &maxflow, CT &mincost) {
        CT inf;
        memset(&inf, 0x3f, sizeof(CT));
        static CT dist[maxn];
        static int rec_e[maxn];
        maxflow = mincost = 0;
        CT realdist = 0;    //real distance from s to t

        bool first = true;
        while (1) {
            if (first) {
                spfa( s, dist, rec_e);
                first = false;
            } else {
                spfa( s, dist, rec_e);
            }
            if (inf == dist[t])
                break;
            FT minF = numeric_limits<FT>::max();
            for (int e = rec_e[t]; ~e; e = rec_e[edge[e].from])
                minF = min(minF, (FT) edge[e].cap);
            maxflow += minF;
            realdist += dist[t];
            mincost += minF * realdist;
            for (int e = rec_e[t]; ~e; e = rec_e[edge[e].from]) {
                edge[e].cap -= minF;
                edge[e ^ 1].cap += minF;
            }
            for (int e = 0; e < tot; ++e) {
                EDGE &ed = edge[e];
                ed.cost += dist[ed.from] - dist[ed.to];
            }
        }
    }
};
int a[maxn];
int main(){
  int n,m,k;
  scanf("%d%d%d",&n,&m,&k);
  int S = n-m+2,T = S+1;
  MFMC::init(T);
  for( int i = 1;i <= n;i++ )scanf("%d",&a[i]);
  for( int i = 1;i <= m;i++ ){
      int v = min( i,n-m+1 );
      MFMC::add( 0,v,1,-a[i] );
  }
  for( int i = 1;i <= n-m;i++ ){
      int j = min( i+m,n-m+1 );
      MFMC::add( i,j,1,-a[i+m] );
  }
  for( int i = 0;i < n-m+1;i++ ){
      MFMC::add( i,i+1,inf,0 );
  }
  MFMC::add( S,0,k,0 );
  MFMC::add( n-m+1,T,k,0 );
  int maxflow,mincost;
  MFMC::mfmc(S,T,maxflow,mincost);
  printf("%d\n",-mincost);
   return 0;
}