Pagini recente » Cod sursa (job #1546013) | Cod sursa (job #2799875) | Cod sursa (job #979229) | Cod sursa (job #1889314) | Cod sursa (job #2500428)
#include <cstdio>
#include <map>
using namespace std;
const int NMAX = 2005;
const int MOD = 0x7fffffff;
long long v[NMAX];
map <long long, long long> mp;
long long 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("%lld", &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]];
}
long long 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 {
long long 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;
}
sol %= MOD;
sp[i][v[j]] %= MOD;
}
for(int j = 1; j <= lim; j++) {
sp[i][j] += sp[i][j - 1];
sp[i][j] %= MOD;
}
}
printf("%lld\n", sol);
return 0;
}