Pagini recente » Cod sursa (job #1325201) | Cod sursa (job #1115054) | Cod sursa (job #3214302) | Cod sursa (job #2822070) | Cod sursa (job #1709581)
#include<iostream>
#include<fstream>
using namespace std;
long long n,a[1000024];
long long countt;
int main(void){
ifstream fin("twoton.in");
ofstream fout("twoton.out");
fin>>n;
for(long long i=0;i<n;i++){
fin>>a[i];
}
long long i;
countt=1;
if (n!=0){
long long minn=a[n-1];
for(i=n-2;i>=0;i--){
if(a[i]<minn){
minn=a[i];
countt=(countt+1)%19997;
}else{
countt=(2*countt+1)%19997;
}
}
}
fout<<countt%19997<<'\n';
fout.close();
fin.close();
return 0;
}