codeforces 818G - Four Melodies 费用流,压缩建图,好题

G. Four Melodies

time limit per test

5 seconds

memory limit per test

1024 megabytes

input

standard input

output

standard output

Author note: I think some of you might remember the problem "Two Melodies" from Eductational Codeforces Round 22. Now it's time to make it a bit more difficult!

Alice is a composer, and recently she had recorded two tracks that became very popular. Now she has got a lot of fans who are waiting for new tracks.

This time Alice wants to form four melodies for her tracks.

Alice has a sheet with n notes written on it. She wants to take four such non-empty non-intersecting subsequences that all of them form a melody and sum of their lengths is maximal.

Subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.

Subsequence forms a melody when each two adjacent notes either differ by 1 or are congruent modulo 7.

You should write a program which will calculate maximum sum of lengths of such four non-empty non-intersecting subsequences that all of them form a melody.

Input

The first line contains one integer number n (4 ≤ n ≤ 3000).

The second line contains n integer numbers a1, a2, ..., an (1 ≤ ai ≤ 105) — notes written on a sheet.

Output

Print maximum sum of lengths of such four non-empty non-intersecting subsequences that all of them form a melody.

Examples

input

5
1 3 5 7 9

output

4

input

5
1 3 5 7 2

output

5

题解：

一种很直观的建图方法就是把每个数字拆成2个点in和out，然后源点也拆成2个点s和s'，并把s'作为费用流的源点。

从s'->s建立一条容量为4费用为0的边。然后从s点向每个in建立一条容量为1，费用为0的边。

再从in向out建立一条容量为1，费用为-1的边。从out向汇点t建立一条容量为1，费用为0的边。

然后对于任意两个notes i,j如果i到j符合相邻的2个条件，那么就从i的out点向j的in点连接一条容量为1费用为0的边，表示他们可以串起来。

这样的话，建图的复杂度为n2，边的个数也为n2，复杂度太高了，因此需要压缩建图。

怎么压缩建图呢？ 

把每个点都扩充成3个点in,mid,out，其中in往mid 连边容量为1，费用为-1，mid往out连边，容量为1，费用为0。

从in往out连边容量为inf，费用为0，表示途径这个点。

关键的一步来了：

从i这个点往后找第一个使得val[i] = val[j]+1的点j，从i.out向j.in连接一条容量为1，费用为0的边。

从i这个点往后找第一个使得val[i] = val[j]-1的点j，从i.out向j.in连接一条容量为1，费用为0的边。

从i这个点往后找第一个使得（val[i] - val[j]）%7 == 0 的点j，从i.out向j.in连接一条容量为1，费用为0的边。

这样的话，图就算压缩完成了（不需要两两比较建图）。

#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int mm = 66666;
const int maxn = 9999;
int node,src,dest,edge;
int ver[mm],flow[mm],cst[mm],nxt[mm];
int head[maxn],work[maxn],dis[maxn],q[maxn];
int tot_cost;
void prepare(int _node,int _src,int _dest)
{
    node=_node,src=_src,dest=_dest;
    for(int i=0; i<node; ++i)head[i]=-1;
    edge=0;
    tot_cost = 0;
}
void addedge(int u,int v,int c,int cost)
{
    ver[edge]=v,flow[edge]=c,nxt[edge]=head[u],cst[edge]=cost,head[u]=edge++;
    ver[edge]=u,flow[edge]=0,nxt[edge]=head[v],cst[edge]=-cost,head[v]=edge++;
}
int ins[maxn];
int pre[maxn];
bool Dinic_spfa()
{
	memset(ins,0,sizeof(ins));
	memset(dis,inf,sizeof(dis));
	memset(pre,-1,sizeof(pre));
	queue<int> Q;
    //int i,u,v,l,r=0;
    Q.push(src);
    dis[src] = 0,ins[src] = 1;
    pre[src] = -1;
    while(!Q.empty()){
    	int u = Q.front();Q.pop();
		ins[u] = 0;
		for(int e = head[u];e != -1;e = nxt[e]){
			int v = ver[e];
			if(!flow[e]) continue;
			if(dis[v] > dis[u] + cst[e]){
				dis[v] = dis[u] + cst[e];
				pre[v] = e;
				if(!ins[v]) ins[v] = 1,Q.push(v);
			}
		}    	
	}
    return dis[dest] < inf;
}
int Dinic_flow()
{
    int i,ret=0,delta=inf;
    while(Dinic_spfa())
    {
    	for(int i=pre[dest];i != -1;i = pre[ver[i^1]])
    		delta = min(delta,flow[i]);
		for(int i=pre[dest];i != -1;i = pre[ver[i^1]])
    		flow[i] -= delta,flow[i^1] += delta;
		ret+=delta;
		tot_cost += dis[dest]*delta;
    }
    return ret;
}
int n;
int a[3333];
int main(){
	scanf("%d",&n);
	for(int i = 0;i < n;++i) scanf("%d",&a[i]);
	//n = 3000;
	//for(int i = 0;i < n;++i) a[i] = 1;
	prepare(3+3*n,0,1+3*n);
	addedge(0,2+3*n,4,0);
	for(int i = 0;i < n;++i){
		addedge(2+3*n,i*3+1,1,0);
		addedge(i*3+1,i*3+2,1,-1);
		addedge(i*3+1,i*3+3,inf,0);
		addedge(i*3+2,i*3+3,1,0);
		addedge(i*3+3,1+3*n,1,0);
	}
	for(int i = 0;i < n;++i){
		for(int j = i+1;j < n;++j){
			if(a[i] == a[j]+1){
				addedge(i*3+3,j*3+1,inf,0);
				break;
			}
		}
		for(int j = i+1;j < n;++j){
			if(a[i] == a[j]-1){
				addedge(i*3+3,j*3+1,inf,0);
				break;
			}
		}
		for(int j = i+1;j < n;++j){
			if(abs(a[i]-a[j])%7 == 0){
				addedge(i*3+3,j*3+1,inf,0);
				break;
			}
		}
	}
	int maxf = Dinic_flow();
	//cout<<maxf<<endl;
	cout<<-tot_cost<<endl;
	return 0;
}