Cod sursa(job #1709386)
Utilizator | Data | 28 mai 2016 12:02:54 | |
---|---|---|---|
Problema | Twoton | Scor | 0 |
Compilator | cpp | Status | done |
Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.45 kb |
#include<iostream>
#include<fstream>
using namespace std;
int arr[1000024];
int n;
int counter=0;
int maxy=100001;
int main()
{
ifstream fin("twoton.in");
ofstream fout("twoton.out");
fin >> n;
for(int i=0;i<n;i++){
fin >> arr[i];
}
for(int i=n-1;i>=0;i--){
if(arr[i]<maxy){
maxy=arr[i];
counter++;
}
else{
counter=counter*2+1;
}
}
fout << counter << endl;
fin.close();
fout.close();
return 0;
}