Cod sursa(job #1709255)
Utilizator | UTCN Furdui Moldovan Militaru UTCN_TBD | Data | 28 mai 2016 11:29:53 |
---|---|---|---|
Problema | Twoton | Scor | 100 |
Compilator | cpp | Status | done |
Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.53 kb |
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream fin("twoton.in");
ofstream fout("twoton.out");
int a[1000024];
int main()
{
int n;
fin >> n;
for (int i = 0; i < n; i++) {
fin >> a[i];
}
int minim = a[n - 1];
int cnt = 1;
for (int i = n - 2; i >= 0; i--) {
if (a[i] < minim) {
cnt = 1 + cnt;
minim = a[i];
}
else {
cnt = 1 + 2 * cnt;
}
if (cnt >= 19997) {
cnt -= 19997;
}
}
fout << cnt << '\n';
fin.close();
fout.close();
return 0;
}