Pagini recente » Cod sursa (job #717815) | Cod sursa (job #3042114) | Cod sursa (job #2453119) | Cod sursa (job #1540375) | Cod sursa (job #1710363)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
const int MOD = 19997;
const int INF = 1 << 30;
int main() {
cin.sync_with_stdio(false);
freopen("twoton.in", "r", stdin);
freopen("twoton.out", "w", stdout);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int mini = INF;
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (v[i] < mini) {
ans = (ans + 1) % MOD;
mini = v[i];
} else {
ans = (2 * ans + 1) % MOD;
}
}
cout << ans;
return 0;
}