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
#include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using ll=long long;
#define pb push_back
#define fst first
#define snd second
using vll=vector<ll>;
using Pii=pair<int,int>;
using Pll=pair<ll,ll>;
using vpii=vector<Pii>;
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#define sim template <class c
#define mor > muu & operator<<(
#define ris return *this
#define R22(r) sim> typename enable_if<1 r sizeof(dud<c>(0)),muu&>::type operator<<(c g) {
sim> struct rge {c b, e;};
sim> rge<c> range(c i, c j) {return rge<c>{i, j};}
sim> auto dud(c*r)->decltype(cerr << *r);
sim> char dud(...);
struct muu {
	#ifdef LOCAL
	stringstream a;
	~muu() {cerr << a.str() << endl;}
	R22(<) a << boolalpha << g; ris;}
	R22(==) ris << range(begin(g), end(g));}
	sim mor rge<c> u) {
		a << "[";
		for (c i = u.b; i != u.e; ++i)
			*this << ", " + 2 * (i == u.b) << *i;
		ris << "]";
	}
	sim, class m mor pair<m,c> r) {ris << "(" << r.first << ", " << r.second << ")";}
	#else
	sim mor const c &){ris;}
	#endif
	muu & operator()(){ris;}
};
#define imie(r) "[" #r ": " << (r) << "] "
#define debug (muu() << __FUNCTION__ << "#" << __LINE__ << ": " )
typedef long long ll;
const int maxn = 60;
int n;
int perm[maxn];
int haczy[maxn];
int res[1 << 27];
int wyn[maxn][maxn * maxn];
int main()
{
	scanf("%d", &n);
	for(int i = 0; i < n; ++i)
		scanf("%d", &perm[i]);
	for(int i = 0; i < n; ++i)
		for(int j = i + 1; j < n; ++j)
			if(perm[i] > perm[j])
				haczy[i] |= 1 << j;
	for(int i = 1; i < (1 << n); ++i)
	{
		int k = __builtin_popcount(i);
		int bez_jednego = i & (i - 1);
		int jeden = i ^ bez_jednego;
		jeden = __builtin_popcount(jeden - 1);
		int h = haczy[jeden] & i;
		res[i] = res[bez_jednego] + __builtin_popcount(h);
		wyn[k][res[i]] += 1;
	}
	for(int i = 1; i <= n; ++i)
	{
		for(int j = 0; j <= n * n; ++j)
			if(wyn[i][j] > 0)
			{
				printf("%d %d\n", j, wyn[i][j]);
				break;
			}
	}
}