Pagini recente » Cod sursa (job #3229763) | Cod sursa (job #190498) | Cod sursa (job #324273) | Cod sursa (job #3211349) | Cod sursa (job #2742962)
#include <bits/stdc++.h>
#define ll long long
#define rest 19997
using namespace std;
ifstream fin("twoton.in");
ofstream fout("twoton.out");
bool smallest[100005];
int n;
int a[100005];
ll ans;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
int small=100005;
for(int i=n;i>=1;i--)
if(small>a[i])
{
small=a[i];
smallest[i]=true;
}
ll cnt=1;
for(int i=1;i<=n;i++)
{
ans=(ans+cnt)%rest;
if(!smallest[i])
cnt=(cnt*2LL)%rest;
}
fout<<ans;
return 0;
}