Pagini recente » Rezultatele filtrării | Monitorul de evaluare | Statistici Melania Ion (melaniaion) | Rezultatele filtrării | Cod sursa (job #1709543)
#include<iostream>
#include<fstream>
using namespace std;
int n,a[1000024];
int countt,count2;
int wtf(int i){
count2++;
if(count2>=19997)
count2-=19997;
if(i==n-1)
return a[i];
if(a[i]<wtf(i+1))
return a[i];
else
return wtf(i+1);
}
int main(void){
ifstream fin("twoton.in");
ofstream fout("twoton.out");
fin>>n;
for(int i=0;i<n;i++){
fin>>a[i];
}
int i;
countt=1;
count2=0;
if (n!=0){
int 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;
}
}
}
//wtf(0);
//if(count2!=countt)
// cout<<"bai";
fout<<countt%19997<<'\n';
fout.close();
fin.close();
return 0;
}