Pagini recente » Cod sursa (job #873342) | Cod sursa (job #1702778) | Cod sursa (job #3212192) | Cod sursa (job #3250880) | Cod sursa (job #1709029)
#include <iostream>
#include<vector>
#include<fstream>
#include<utility>
using namespace std;
int n;
int a[2000024];
int count = 0;
int wtf (int i) {
count++;
if (count >= 19997) {
count -= 19997;
}
if (i == n-1) {
return a[i];
}
if (a[i] < wtf(i+1))
return a[i];
else {
return wtf(i+1);
}
}
int main() {
ifstream cin("twoton.in");
ofstream cout("twoton.out");
cin>>n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long c = 1, ret = a[n-1];
for (int i = n - 2; i >= 0; i--) {
if (a[i] < ret) {
c = c + 1;
c %= 19997;
ret = a[i];
}
else {
c = 2 * c;
c = c + 1;
c %= 19997;
}
}
cout << c << '\n';
return 0;
}