1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85

#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;

const int MAXN = 1100,MAXM = MAXN*MAXN;

struct Edge{
  int from,to;
  int cap,flow;
  int nex;
}edge[MAXM];
int fir[MAXN],ecnt = 2;
void addedge(int a,int b,int c){
  edge[ecnt] = (Edge){a,b,c,0,fir[a]};fir[a] = ecnt++;
  edge[ecnt] = (Edge){b,a,0,0,fir[b]};fir[b] = ecnt++;
}

int dis[MAXN];
bool bfs(int s,int t){
  static queue<int> q;
  memset(dis,0,sizeof(dis));while(!q.empty()) q.pop();
  dis[s] = 1,q.push(s);
  while(!q.empty()){
    int x = q.front();q.pop();
    for(int e = fir[x];e;e = edge[e].nex){
      int v = edge[e].to;
      if(!dis[v] && edge[e].cap > edge[e].flow){
        dis[v] = dis[x]+1;q.push(v);
      }
    }
  }
  return dis[t];
}
int dfs(int x,int t,int limit =inf){
  if(limit == 0 || x == t) return limit;
  int sumf = 0;
  for(int e = fir[x];e;e = edge[e].nex){
    int v = edge[e].to;
    if(dis[v] == dis[x]+1){
      int f = dfs(v,t,min(limit,edge[e].cap - edge[e].flow));
      if(f){
        sumf += f,limit -= f;
        edge[e].flow += f,edge[e^1].flow -= f;
        if(limit == 0) break;
      }
    }
  }
  return sumf;
}

int dinic(int s,int t){
  static int ans = 0;
  while(bfs(s,t)) ans += dfs(s,t);
  return ans;
}

int n;
int x[MAXN],dp[MAXN];

void init(){
  scanf("%d",&n);
  for(int i = 1;i<=n;i++) scanf("%d",&x[i]);
}

void solve(){
  int ans = 0,S = n+1,T = 2*n+3;// 0 -> n && n+1 -> 2*n+1
  for(int i = 1;i<=n;i++) addedge(i,i+n+1,1);
  for(int i = 1;i<=n;i++){
    for(int j = 0;j<i;j++)if(x[j] <= x[i]) dp[i] = max(dp[i],dp[j]+1);
    for(int j = 0;j<i;j++)if(x[j] <= x[i] && dp[j] + 1 == dp[i]) addedge(j+n+1,i,1);
    ans = max(ans,dp[i]);
  }
  for(int i = 1;i<=n;i++) if(dp[i] == ans) addedge(i+n+1,T,1);
  printf("%d\n",ans);
  printf("%d\n",dinic(S,T));
  addedge(1,1+n+1,n*n-1),addedge(n,n+n+1,n*n-1);
  addedge(S,1,n*n-1);
  if(dp[n] == ans) addedge(n+n+1,T,n*n-1);
  printf("%d\n",dinic(S,T));
}

int main(){
  init(),solve();
  return 0;
}