Pagini recente » Cod sursa (job #2947170) | Cod sursa (job #615328) | Cod sursa (job #2196880) | Cod sursa (job #1570313) | Cod sursa (job #1711914)
#include<bits/stdc++.h>
using namespace std;
int n;
int a[1000024];
int count4 = 0;
int K=0;
long long comparator;
long long count2;
int i;
ifstream fin("twonton.in");
ofstream fout("twonton.out");
int main()
{
fin>>n;
for (int i = 0; i < n; ++i)
{
fin>>a[i];
}
comparator=a[n-1];
count2=1;
for(i=n-2;i>=0;i--)
{
if(a[i]>comparator)
count2*=2;
else
comparator=a[i];
count2++;
if (count2 >= 19997)
{
count2 -= 19997;
}
}
fout<<count2;
return 0;
}