tanvir002700

#include<stdio.h>
class Stack
{
private:
    class node
    {
        public:
        int data;
        node *next;
        node()

tanvir002700

#include<stdio.h>
class Stack
{
private:
    class node
    {
        public:
        int data;
        node *next;
        node()

tanvir002700

class node
{
    public:
    int data;
    node *next;
    node()
    {
        next=NULL;
    }
};

tanvir002700

void append(int val)
{
    Size++;
    node *temp=new node();
    temp->data=val;
    if(Head==NULL)
    {
        Head=tail=temp;
        return;
    }

tanvir002700

void add(int pos,int val)
{
    node *temp=new node();
    temp->data=val;
    if(pos==0)
    {
        Size++;
        temp->next=Head;
        Head=temp;
        return;

tanvir002700

void Delete(int pos)
{
    node *temp,*left,*right;
    if(pos==0)
    {
        Size--;
        temp=Head;
        Head=Head->next;
        delete(temp);
        return;

tanvir002700

void show()
{
    node *temp=Head;
    while(temp!=NULL)
    {
        cout<<temp->data<<" "; 
        temp=temp->next;
    }
    cout<<endl;
}

tanvir002700

#include<stdio.h>
#include<iostream>
using namespace std;
class List
{
private:
    class node
    {
    public:
        int data;

tanvir002700

void Compute_ST(int N)
{
    for (int i=0;i<N;i++)ST[0][i] = i;
    for (int k = 1;(1 << k)<N; k++)
    {
        for (int i=0;i+(1<<k)<=N;i++)
        {
            int x = ST[k-1][i];
            int y = ST[k-1][i+(1<<k-1)];
            ST[k][i]=A[x]<=A[y]?x:y;

tanvir002700

int RMQ(int i, int j)
{
    int k = log2(j-i);
    int x = ST[k][i];
    int y = ST[k][j-(1<<k)+1];
    return A[x] <= A[y] ? x : y;
}