Pagini recente » Cod sursa (job #2567912) | Cod sursa (job #1351928) | Profil gosu_gamer | Cod sursa (job #2925850) | Cod sursa (job #1709346)
#include <fstream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <functional>
#include <utility>
#include <cstdio>
using namespace std;
int a[1000024];
int nr[1000024];
#define MOD 19997
int main()
{
//ios_base::sync_with_stdio(false);
freopen("twoton.in", "r", stdin);
freopen("twoton.out", "w", stdout);
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i){
scanf("%d", &a[i]);
}
int minim = a[n-1];
nr[n-1] = 1;
for (int i = n-2; i >= 0; --i){
nr[i] = 1 + nr[i+1];
if (a[i] < minim) minim = a[i];
else nr[i] += nr[i + 1];
nr[i] %= MOD;
}
printf("%d\n", nr[0]);
return 0;
}