Cod sursa(job #1709232)
| Utilizator | Data | 28 mai 2016 11:23:18 | |
|---|---|---|---|
| Problema | Twoton | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.51 kb |
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
int main() {
std::ifstream fin("twoton.in");
std::ofstream fout("twoton.out");
int N;
fin >> N;
std::vector<int> v(N);
for (int i = 0; i < N; ++i) {
fin >> v[i];
}
long long total = 1;
int min = v[N - 1];
for (int i = N - 2; i >= 0; --i) {
total = (1 + (min <= v[i] ? 2 : 1) * total) % 19997;
min = std::min(v[i], min);
}
fout << total;
}
