Pagini recente » Cod sursa (job #2420468) | Cod sursa (job #3239483) | Cod sursa (job #608032) | Cod sursa (job #1464990) | Cod sursa (job #1710575)
#include <iostream>
#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int DP[100005];
int a[100005];
int wtf[100005];
int main(){
int n;
cin>>n;
for(int i=0; i<n;i++){
cin>>a[i];
}
wtf[n-1] = a[n-1];
for(int i = n-2; i >= 0; i--){
wtf[i] = a[i] < wtf[i+1] ? a[i] : wtf[i+1];
}
DP[n-1] = 1;
for(int i = n-2; i>=0; i--){
DP[i] = (1 + (a[i] < wtf[i+1] ? DP[i+1] : 2 * DP[i+1]))%19997;
}
cout << DP[0];
return 0;
}