Pagini recente » Cod sursa (job #2792840) | Autentificare | Cod sursa (job #1019568) | Cod sursa (job #1682769) | Cod sursa (job #1713019)
#include <fstream>
using namespace std;
ifstream fin("twoton.in");
ofstream fout("twoton.out");
int n;
int val[1000001],cnt[1000001],a[1000001];
int i;
int main()
{
fin>>n;
for(i=1;i<=n;++i) fin>>a[i];
val[n]=a[n];
cnt[n]=1;
for(i=n-1;i>=1;--i)
{
if(val[i+1]>a[i]) {cnt[i]=(1+cnt[i+1])%19997; val[i]=a[i];}
else
{
cnt[i]=(1+2*cnt[i+1])%19997;
val[i]=val[i+1];
}
}
fout<<cnt[1];
}