🌐Tiếng ViệtEnglishPortuguêsTiếng Việtفارسی中文EntityQ1334332· pop 8· linked from 6 articlesBài toán mảng con lớn nhấtAlso known as maximum sum subarray problemthe task of finding a contiguous subarray with the largest sum in a given array of numbersAvailable in 8 languages中文PortuguêsGeorgianGreekSerbianTiếng Việtفارسیvia Wikidata sitelinks · CC0Connectionscomputer scienceEntityInternational Standard Book NumberEntityCategoriesDynamic programmingOptimization algorithms and methodsPolynomial-time problems