Cod sursa(job #1709088)
| Utilizator | Data | 28 mai 2016 10:51:36 | |
|---|---|---|---|
| Problema | Twoton | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.47 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n,a[1000024];
long long countt,i;
long long M = 19997;
int main(void){
ifstream fin("twoton.in");
ofstream fout("twoton.out");
fin>>n;
for(i=0;i<n;i++){
fin>>a[i];
}
countt=1;
if (n!=0){
int minn=a[n-1];
for(i=n-2;i>=0;i--){
if(a[i]<minn){
countt=(countt+1)%M;
}else{
countt=(2*countt+1)%M;
}
}
}
fout<<countt<<'\n';
fout.close();
fin.close();
return 0;
}
