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