Pagini recente » Cod sursa (job #2869979) | Cod sursa (job #3203714) | Cod sursa (job #771254) | Cod sursa (job #692693) | Cod sursa (job #2011500)
/*
Simulez liniar.
*/
#include<fstream>
using namespace std;
ifstream fi("twoton.in");
ofstream fo("twoton.out");
int n,i,A[100001],nr,count;
int main()
{
fi>>n;
for(i=1; i<=n; i++)
fi>>A[i];
nr=A[n];
count=1;
for(i=n-1; i>=1; i--)
{
if(A[i]<nr)
{
nr=A[i];
count=(1+count)%19997;
}
else
{
count=(1+2*count)%19997;
}
}
fo<<count%19997<<"\n";
fi.close();
fo.close();
return 0;
}