[最大权闭合子图] BZOJ 4873 [Shoi2017]寿司餐厅

一直以为是DP 结果是网络流
orz WrongAnswer

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

namespace D{
  const int N=20005;
  const int M=N<<2;
  struct edge{
    int u,v,f,next;
  }G[M<<1];
  int head[N],inum=1;
  inline void add(int u,int v,int f,int p){
    G[p].u=u; G[p].v=v; G[p].f=f; G[p].next=head[u]; head[u]=p;
  }
  inline void link(int u,int v,int f){
    add(u,v,f,++inum),add(v,u,0,++inum);
  }
#define V G[p].v
  int S,T;
  int dis[N],Q[N],l,r;
  inline bool bfs(){
    l=r=-1; for (int i=1;i<=T;i++) dis[i]=-1;
    Q[++r]=S; dis[S]=0;
    while (l<r){
      int u=Q[++l];
      for (int p=head[u];p;p=G[p].next)
    if (G[p].f && dis[V]==-1){
      dis[V]=dis[u]+1; Q[++r]=V;
      if (V==T) return 1;
    }
    }
    return 0;
  }
  int cur[N];
  inline int dfs(int u,int flow){
    if (u==T) return flow;
    int used=0;
    for (int p=cur[u];p;p=G[p].next){
      cur[u]=p;
      if (dis[V]==dis[u]+1 && G[p].f){
    int d=dfs(V,min(flow-used,G[p].f));
    G[p].f-=d; G[p^1].f+=d;
    used+=d; if (used==flow) break;
      }
    }
    if (!used) dis[u]=-1;
    return used;
  }
  inline int Dinic(){
    int ans=0;
    while (bfs()){
      memcpy(cur,head,sizeof(int)*(T+5));
      ans+=dfs(S,1<<30);
    }
    return ans;
  }
}

const int N=105;

int n,m;
int w[N][N],a[N];
int idw[N][N],ida[1005],tot;

int Ans=0;

inline void Val(int x,int val){
  using namespace D;
  if (val>0) Ans+=val,link(S,x,val);
  if (val<0) link(x,T,-val);
}

int main(){
  using namespace D;
  int maxa=0;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(m);
  for (int i=1;i<=n;i++) read(a[i]),maxa=max(maxa,a[i]);
  for (int i=1;i<=n;i++)
    for (int j=i;j<=n;j++)
      read(w[i][j]),idw[i][j]=++tot;
  for (int i=1;i<=maxa;i++) ida[i]=++tot;
  S=tot+1; T=tot+2;
  for (int i=1;i<=n;i++)
    for (int j=i;j<=n;j++)
      if (i==j){
    Val(idw[i][j],w[i][j]-a[i]);    
      }else{
    Val(idw[i][j],w[i][j]);
    link(idw[i][j],idw[i+1][j],1<<30);
    link(idw[i][j],idw[i][j-1],1<<30);
      }
  for (int i=1;i<=maxa;i++) Val(ida[i],-m*i*i);
  for (int i=1;i<=n;i++)
    link(idw[i][i],ida[a[i]],1<<30);
  Ans-=Dinic();
  printf("%d\n",Ans);
  return 0;
}