Files
marqdo/tests/blind/tasks/qb_max_sublist_sum.md
T
cflmy 9331af78e2 release(2.8.0): 合入 CHANGELOG/README/发版说明/skills prove 任务;CI 链接指向 doc/releases
- CHANGELOG.md:v2.8.0 条目(中英双语);
- README.md:版本行 2.7.1→2.8.0 + 愿景第 6 条(知识可证明);
- doc/releases/v2.8.0.md:双语发版说明(亮点/用法/已知限制);
- skills/marqdo-dev/index.mq.md:新增 prove 任务(路径/目录模式/
  require_lean/json;参数用 + 行声明升参,check 与 narrative-ratio 通过);
- 设计文档 §12.5 标记已合入;发版链接统一指向 doc/releases/v2.8.0.md。
2026-11-18 10:29:26 +08:00

776 B
Executable File

Task: qb_max_sublist_sum (hard) — Maximum Sublist Sum

Implement the maximum contiguous sublist sum as a function named max_sublist_sum in a Marqdo .mq.md program. The function takes a list of integers and returns the maximum sum of any contiguous sublist (at least one element).

Requirements

  1. Function name max_sublist_sum.
  2. In # main, hardcode the demo inputs below and print each result on its own line — exactly three lines, no labels.

Demo inputs (hardcode)

  • [-2, 1, -3, 4, -1, 2, 1, -5, 4]
  • [1, 2, 3]
  • [-3, -1, -2]

Expected output (self-check)

Three lines:

6
6
-1

Deliverable

Write the program as a Marqdo .mq.md file. Return the complete source in a single ```markdown fence — no prose outside the fence.