Mai intai trebuie sa te autentifici.
Cod sursa(job #941620)
| Utilizator | Data | 19 aprilie 2013 10:47:50 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include<fstream>
using namespace std;
ifstream fin("bursa.in");
ofstream fout("bursa.out");
const int MAXN = 100010;
int v[MAXN], n, s;
long long sum;
bool b;
int main(){
int i;
fin >> n >> sum;
for(i=0; i<n; ++i)
fin >> v[0];
if(v[0] < v[1])
b = 0;
else
b = 1;
for(i=0; i<n; ++i){
if(b == 0){
while(v[i] < v[i+1]){
++i;
}
b = 1;
sum= v[i+1]*nr;
}
else{
while(v[i] >= v[i+1]){
++i;
}
b = 0;
if(i != n)
nr = s/v[i+1];
}
}
fout << sum;
fin.close();
fout.close();
return 0;
}
