Pagini recente » Cod sursa (job #1411952) | Cod sursa (job #1016504) | Cod sursa (job #2074954) | Cod sursa (job #2679005) | Cod sursa (job #1739612)
#include<bits/stdc++.h>
using namespace std;
int n;
int a[1000024];
int v[1000010];
long long cnt[1000100];
ifstream in("twoton.in");
ofstream out("twoton.out");
int main()
{
in>>n;
for(int i=1;i<=n;++i)
in>>a[i];
v[n]=a[n];
cnt[n]=1;
for(int i=n-1;i>=1;--i)
if(a[i]>v[i+1])
{
v[i]=v[i+1];
cnt[i]=1+2*cnt[i+1];
cnt[i] %= 19997;
}
else
{
v[i]=a[i];
cnt[i]=cnt[i+1]+1;
cnt[i] %= 19997;
}
out<<cnt[1]%19997;
return 0;
}