Pagini recente » Cod sursa (job #1336778) | Cod sursa (job #2714150) | Cod sursa (job #1725831) | Cod sursa (job #1946104) | Cod sursa (job #1709313)
#include <iostream>
#include <stdio.h>
#define NMAX 1000025
#define MOD 19997
using namespace std;
long long n, i, cost, a[NMAX], minim;
int main() {
freopen("twoton.in", "r", stdin);
freopen("twoton.out", "w", stdout);
scanf("%d", &n);
for(i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
cost = 1; minim = a[n - 1];
for(i = n - 2; i >= 0; --i) {
if(a[i] < minim) {
minim = a[i];
cost = (cost + 1) % MOD;
} else {
cost = (2 * cost + 1) % MOD;
}
}
printf("%d\n", cost);
return 0;
}