Algoritmlash

S=tl(l)-t2(l)+tl(2)-t2(3)+tl(3)-t2(4)+tl(4)-t2(2)=15+0+6+ 63= 84
ko'Yana davom ettirish mumkin. Lekin hu usulda hamma holni rib chiqish ancha murakkab bo'lar ekan. Shumng uchun

matematikaga murojaat etamiz:

Agar A <■ B va C £ D bo'lsa, u holda

A - C + B D 2 A - D + B C

bo'ladi.

Haqiqatan, A - B < 0 v a C - D £ 0 boMgani uchun:

< (A - B) • (C - D) S 0 <=>A • (C - D) - B ■ ( C - D) > 0 <=>D

=>A-C + B • D - A • D - B - C > 0 < = > A - C + B - D> A -

+ B C

Demak, juftliklar ko‘paytmasining yig'indisi eng katta qiy- matli boMishi uchun juftliklarni bir xil tartibda (yoki ikkalasini o'sish tartibida, yoki ikkalasini kamayish tartibida) saralash lozim.

Bu xulosaga asosan tuzilgan algoritm quyidagicha boMadi: TAKRORLANSIN N-1 MARTA

1 DAN N-i GACHA BAJAR

AGAR tl(j)< tl(j+ l)

U H {tl(*)-qavatdagi tokchalarni saralash}

OLDA