Pagini recente » Cod sursa (job #392945) | Cod sursa (job #335924) | Profil Djok | Cod sursa (job #663744) | Cod sursa (job #1709084)
#include <iostream>
#include <fstream>
using namespace std;
const int MAXN = 100100;
const int MOD = 19997;
int v[MAXN], cur[MAXN], minim, n;
ifstream fin("twoton.in");
ofstream fout("twoton.out");
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
cur[n] = 1;
minim = v[n];
for (int i = n - 1; i > 0; --i) {
if (v[i] < minim) {
cur[i] = cur[i + 1] + 1;
minim = v[i];
if (cur[i] >= MOD)
cur[i] -= MOD;
}
else {
cur[i] = cur[i + 1] * 2 + 1;
if (cur[i] >= MOD)
cur[i] -= MOD;
}
}
fout << cur[1];
return 0;
}