K Subsequence

 http://acm.hdu.edu.cn/showproblem.php?pid=6611

总计：最小费用最大流~

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
//#define pii pair<int,int>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e4+9;
const int maxm=1e6+9;
const int mod=1e9+7;

/*******
dijkstra优化费用流模板
*******/

typedef pair<int, int> pii;//first保存最短距离，second保存顶点的编号
struct edge {
    int to, cap, cost, rev; //终点,容量（指残量网络中的）,费用,反向边编号
    edge() {}
    edge(int to, int _cap, int _cost, int _rev):to(to), cap(_cap), cost(_cost), rev(_rev) {}
};
int V;          //顶点数
int h[maxn];    //顶点的势
int dis[maxn];  //最短距离
int prevv[maxn];//最短路中的父结点
int pree[maxn]; //最短路中的父边
vector<edge> G[maxn];   //图的邻接表

void init(int n) {
    V = n;
    for(int i = 0; i <= V; ++i) G[i].clear();
}
void addEdge(int from, int to, int cap, int cost){
    G[from].push_back(edge(to, cap, cost, G[to].size()));
    G[to].push_back(edge(from, 0, -cost, G[from].size() - 1));
}
int MCMF(int s, int t, int f, int &flow){   //f为最多能流多少
    int res = 0;
    for(int i = 0; i < 1 + V; i++) h[i] = 0;
    while(f){
        priority_queue<pii, vector<pii>, greater<pii> > q;
        for(int i = 0; i < 1 + V; i++) dis[i] = INF;
        dis[s] = 0; q.push(pii(0, s));
        while(!q.empty()) {
            pii now = q.top(); q.pop();
            int v = now.second;
            if(dis[v] < now.first) continue;
            for(int i = 0; i < G[v].size(); ++i) {
                edge &e = G[v][i];
                if(e.cap > 0 && dis[e.to] > dis[v] + e.cost + h[v] - h[e.to]){
                    dis[e.to] = dis[v] + e.cost + h[v] - h[e.to];
                    prevv[e.to] = v;
                    pree[e.to] = i;
                    q.push(pii(dis[e.to], e.to));
                }
            }
        }
        if(dis[t] == INF) break;
        for(int i = 0; i <= V; ++i) h[i] += dis[i];
        int d = f;
        for(int v = t; v != s; v = prevv[v]) d = min(d, G[prevv[v]][pree[v]].cap);
        f -= d; flow += d; res += d * h[t];
        for(int v = t; v != s; v = prevv[v]) {
            edge &e = G[prevv[v]][pree[v]];
            e.cap -= d;
            G[v][e.rev].cap += d;
        }
    }
    return res;
}

int a[maxn];
int main()
{
    FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;
    cin>>T;
    while(T--)
    {
        int n,k;
        cin>>n>>k;

        init(n*2+10);

        int s=n*2+1,e=n*2+2;


        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            addEdge(i,i+n,1,-a[i]);
        }

        for(int i=1;i<=n;i++)
        {
            for(int j=i+1;j<=n;j++)
            {
                if(a[j]>=a[i])
                {
                    addEdge(i+n,j,INF,0);
                }
            }
        }

        for(int i=1;i<=n;i++)
        {
            addEdge(s,i,INF,0);
            addEdge(i+n,e,INF,0);
        }

        int flow;
        cout<<-MCMF(s,e,k,flow)<<endl;

    }


    return 0;
}