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