Cod sursa(job #1709750)
Utilizator | HePoBaMa UAICHePoBaMa | Data | 28 mai 2016 13:44:22 |
---|---|---|---|
Problema | Twoton | Scor | 0 |
Compilator | cpp | Status | done |
Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.46 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("twoton.in");
ofstream g("twoton.out");
int main() {
int n;
f >> n;
int * numbers = new int[n];
for (int i = 0; i < n; ++i) {
f >> numbers[i];
}
int currentMin = numbers[n - 1];
int result = 0;
for (int i = n - 1; i >= 0; --i) {
if (currentMin > numbers[i]) {
result += 1;
}
else {
result = 2 * result + 1;
}
}
g << result;
f.close();
g.close();
}