Pagini recente » Cod sursa (job #2524039) | Cod sursa (job #2970017) | Cod sursa (job #1926115) | Cod sursa (job #252947) | Cod sursa (job #1709071)
#include<iostream>
#include<fstream>
using namespace std;
long long n,a[1000024];
long long countt,i;
long long M = 19997;
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)%M;
}else{
countt=(2*countt+1)%M;
}
}
}
fout<<countt<<'\n';
fout.close();
fin.close();
return 0;
}