Pagini recente » Cod sursa (job #1030778) | Cod sursa (job #1944590) | Cod sursa (job #1756674) | Cod sursa (job #1454572) | Cod sursa (job #2560843)
#include <fstream>
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int n, i, a[90010], val[30010], sol[30010];
void initializeaza(int st, int dr, int nod){
if(st==dr){
a[nod]=1;
}else{
int mid=(st+dr)/2;
initializeaza(st, mid, nod*2);
initializeaza(mid+1, dr, nod*2+1);
a[nod]=a[nod*2]+a[nod*2+1];
}
}
void gaseste(int st, int dr, int nod, int pozCautata){
if(st==dr){
sol[nod];
}else{
int mid=(st+dr)/2;
}
}
int main(){
fin>>n;
for(i=1; i<=n; i++){
fin>>a[i];
}
initializeaza(1, n, 1);
for(i=n; i>=1; i--){
}
}