Pagini recente » Cod sursa (job #1469039) | Cod sursa (job #607412) | Cod sursa (job #183220) | Cod sursa (job #302677) | Cod sursa (job #1709138)
#include<fstream>
#define mod 19997
#define DIM 100005
using namespace std;
int n, i, minim, sum;
int v[DIM], d[DIM];
ifstream fin("twoton.in");
ofstream fout("twoton.out");
int main(){
fin>> n;
for(i = 1; i <= n; i++){
fin>> v[i];
}
d[n] = 1;
minim = v[n];
for(i = n - 1; i >= 1; i--){
d[i] = d[i + 1] + 1;
if(d[i] >= mod){
d[i] -= mod;
}
if(v[i] < minim){
minim = v[i];
}
else{
d[i] += d[i + 1];
if(d[i] >= mod){
d[i] -= mod;
}
}
}
fout<< d[1] <<"\n";
return 0;
}