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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int) a.size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr;
typedef double DB;
typedef pair<DB,DB> pdd;
typedef pair<ll,bool> plb;
constexpr ll MAXN=static_cast<ll>(2e5)+10,INF=static_cast<ll>(5e18)+3;
ll N,M,T,A[MAXN],B[MAXN];
vector<ll> pos[MAXN];
ll tr[MAXN];
ll sumApos[MAXN];
ll rsumApos[MAXN];
inline ll lowbit(const ll &x){
return (x&(-x));
}
inline void add(ll p,ll x){
while(p<=M){
tr[p]+=x;
p+=lowbit(p);
}
}
inline ll findBig(ll x,ll sum){
ll res=0;
while(x>0){
res+=tr[x];
x-=lowbit(x);
}
res=sum-res;
return res;
}
inline void solve(){
cin>>N>>M;
FOR(i,1,N){
cin>>A[i];
B[i]=(A[i]+M-1)%M;
pos[A[i]].pb(i);
}
vector<ll> ans;
ll lans=0;
FOR(i,1,N){
lans+=findBig(B[i]+1,i-1);
add(B[i]+1,1);
}
ans.pb(lans);
FOR(i,0,M-1){
ll cnt=0;
for(int j=0;j<pos[i].size();++j){
++cnt;
sumApos[i]+=pos[i][j]-cnt;
}
}
FOR(i,0,M-1){
ll cnt=0;
for(int j=0;j<pos[i].size();++j){
rsumApos[i]+=N-pos[i][j]-cnt;
++cnt;
}
}
ll upAns=lans;
ROF(i,M-1,1){
ll ians=0;
ll idx=M-(i);
ians=upAns-sumApos[idx]+rsumApos[idx];
ans.pb(ians);
upAns=ians;
}
reverse(all(ans));
for(int i=0;i<ans.size();++i){
cout<<ans[i]<<"\n";
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
solve();
return 0;
}
|
