Cod sursa(job #2741501)
Utilizator | Data | 16 aprilie 2021 11:23:51 | |
---|---|---|---|
Problema | Twoton | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva ICPC | Marime | 0.51 kb |
#include<bits/stdc++.h>
using namespace std;
const int maxN=(1e5)+5;
const int mod=19997;
int n,v[maxN];
int wtf[maxN];
int main()
{
freopen("twoton.in","r",stdin);
freopen("twoton.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&v[i]);
int minim=INT_MAX;
wtf[n-1]=1;
minim=v[n-1];
for(int i=n-2;i>=0;i--)
if(v[i]<minim)
wtf[i]=(1+wtf[i+1])%mod,minim=v[i];
else wtf[i]=(1+2*wtf[i+1])%mod;
printf("%d\n",wtf[0]);
return 0;
}