Pagini recente » Cod sursa (job #254056) | Cod sursa (job #1008213) | Cod sursa (job #2536354) | Cod sursa (job #859749) | Cod sursa (job #2500429)
#include <cstdio>
#include <map>
using namespace std;
const int NMAX = 2005;
int v[NMAX];
map <int, int> mp;
int sp[NMAX][NMAX];
int main() {
int n;
freopen("psir.in", "r", stdin);
freopen("psir.out", "w", stdout);
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
scanf("%d", &v[i]);
mp[v[i]] = 0;
}
int lim = 0;
for(auto &it : mp) {
lim++;
it.second = lim;
}
for(int i = 1; i <= n; i++) {
v[i] = mp[v[i]];
}
int sol = 0;
for(int i = 2; i <= n; i++) {
for(int j = 1; j < i; j++) {
if(v[i] == v[j]) {
sol++;
sp[i][v[j]]++;
}
else {
int nr = 0;
if(v[i] > v[j]) {
nr = sp[j][lim] - sp[j][v[i]] + 1;
}
else {
nr = sp[j][v[i] - 1] + 1;
}
sol += nr;
sp[i][v[j]] += nr;
}
}
for(int j = 1; j <= lim; j++) {
sp[i][j] += sp[i][j - 1];
}
}
printf("%d\n", sol);
return 0;
}