Pagini recente » Cod sursa (job #2542021) | Cod sursa (job #14460) | Cod sursa (job #1301630) | Cod sursa (job #2335843) | Cod sursa (job #1708947)
/*************************************************************\
~*********************ENJOY THE SILENCE***********************~
\*************************************************************/
#include <bits/stdc++.h>
using namespace std;
/*******************Debugging defines*************************/
#define ok_dump() cerr<<"OK\n"
#define var_dump(x) cerr<<#x": "<<x<<'\n'
#define arr_dump(x, n) {cerr<<#x"[]: ";\
for(int _=0;_<n;++_) cerr<<x[_]<<" ";cerr<<'\n';}
/*************************************************************/
const int MAXN = 500000;
int A[MAXN], Count[MAXN], Ret[MAXN];
int main() {
// assert(freopen("input.txt", "r", stdin));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ifstream fin("twoton.in");
ofstream fout("twoton.out");
int n;
fin >> n;
for(int i = 0; i < n; ++i)
fin >> A[i];
Ret[n - 1] = A[n - 1];
Count[n - 1] = 1;
for(int i = n - 2; i >= 0; --i) {
Count[i] = 1 + Count[i + 1];
if(A[i] < Ret[i + 1]) {
cerr << "sdk" << i << '\n';
Ret[i] = A[i];
} else {
Ret[i] = Ret[i + 1];
Count[i] += Count[i + 1];
}
Count[i] %= 19997;
}
fout << Count[0];
return 0;
}
/*************************************************************\
~*********************ENJOY THE SILENCE***********************~
\*************************************************************/