|
3-amaliy ishiBajardi: 430-22-guruh talabasi Abdurahmatov Anvarjon
|
| Sana | 14.12.2023 | | Hajmi | 213,81 Kb. | | #118382 |
Bog'liq Anvarjon 3-mavzu, 7-sinf konspekt, Monitoring test 5-sinf matem, 30.04.2023, 1698397231, 5001-Article Text-9689-1-10-20230226
MUHAMMAD AL-XORAZMIY NOMIDAGI TOSHKENT AXBOROT TEXNOLOGIYALARI UNIVERSITETI INFOKOMMUNIKATSIYALAR FAKULTETI Ma’lumotlar tuzilmasi va algoritmlar fanidan
3-amaliy ishiBajardi: 430-22-guruh talabasi Abdurahmatov Anvarjon
Tekshirdi:SWD015-3 Djangazova Kumriniso Abdulvoxabovna TOSHKENT 2023
#include
#include
#include
using namespace std;
int main() {
int n;
cout << "Navbat uzunligini kiriting: ";
cin >> n;
queue myQueue;
stack myStack;
deque myDeque;
// Navbatni to'ldirish
cout << "Navbat elementlarini kiriting:\n";
for (int i = 0; i < n; ++i) {
int element;
cin >> element;
myQueue.push(element);
myStack.push(element);
myDeque.push_back(element);
}
// Eng kichik elementni topish
int minQueue = myQueue.front();
int minStack = myStack.top();
int minDeque = myDeque.back();
// Navbatning eng kichik elementini topish
while (!myQueue.empty()) {
if (myQueue.front() < minQueue) {
minQueue = myQueue.front();
}
myQueue.pop();
}
// Stekning eng kichik elementini topish
while (!myStack.empty()) {
if (myStack.top() < minStack) {
minStack = myStack.top();
}
myStack.pop();
}
// Dekning eng kichik elementini topish
for (int i = 0; i < n; ++i) {
if (myDeque[i] < minDeque) {
minDeque = myDeque[i];
}
}
// Eng kichik elementni 0 bilan almashtirish
cout << "Eng kichik element: " << minQueue << endl;
cout << "Eng kichik elementni 0 bilan almashtirilgan qiymati: " << minQueue - 0 << endl;
return 0;
}
|
| |
