1. ORDONARE CRESCATOARE

#include <iostream>
using namespace std;

bool verif(int v[], int st, int dr);
int main()
{
	int v[505];
	int n;
	cin>>n;
	for(int i=1; i<=n; i++)
		cin>>v[i];
	if(verif(v, 1, n))
		cout<<"DA";
	else
		cout<<"NU";
	return 0;
}

bool verif(int v[], int st, int dr)
{
	if(dr-st<=1)
	{
		if(v[st]<=v[dr])
			return true;
		else
			return false;
	}
		int mij=(st+dr)/2;
	bool x=verif(v, st, mij);
	bool y=verif(v, mij, dr);
	return x && y;

}


---------------------------------------------------

2. MINIM SI MAXIM

#include <iostream>
using namespace std;

int n;
int v[101];
int maxim(int st, int dr);
int minim(int st, int dr);

int main()
{
	cin>>n;
	for(int i=1; i<=n; i++)
		cin>>v[i];
	cout<<maxim(1, n)<<' '<<minim(1, n);
}

int maxim(int st, int dr)
{
	if(st==dr)
		return v[st];
	else
	{
		int m=(st+dr)/2;
		return max(maxim(st, m), maxim(m+1, dr));
	}
}

int minim(int st, int dr)
{
	if(st==dr)
		return v[st];
	else
	{
		int m=(st+dr)/2;
		return min(minim(st, m), minim(m+1, dr));
	}
}


-----------------------------------------------------------------------

5. CMMDC

#include <iostream>
using namespace std;

int cmmdc(int v[], int st, int dr);
int main()
{
	int v[1005];
	int n;
	cin>>n;
	for(int i=1; i<=n; i++)
		cin>>v[i];
	cout<<cmmdc(v, 1, n);
	return 0;
}

int cmmdc(int v[], int st, int dr)
{
	if(st==dr)
		return v[st];
	else
	{
		int mij=(st+dr)/2;
		int x=cmmdc(v, st, mij);
		int y=cmmdc(v, mij+1, dr);
		int r=x%y;
		while(r)
		{
			x=y;
			y=r;
			r=x%y;
		}
		return y;
	}
}


----------------------------------------------------------------------

6. UMA ELEMENTE VECTOR

#include<iostream>
#include<algorithm>
using namespace std;
int v[1001];
void citire(int v[], int &n);
int sum(int st, int dr);
int main()
{
	int n;
	cin>>n;
	citire(v, n);
	cout<<sum(1, n);

	return 0;
}

void citire(int v[], int &n)
{
	for(int i=1; i<=n; i++)
		cin>>v[i];
}

int sum(int st, int dr)
{
	if(dr==st)
		return v[st];
	else
	{
		int mij=(st+dr)/2;
		int x=sum(st, mij);
		int y=sum(mij+1, dr);
		return x+y;
	}
}