# 2009

* [模式匹配(kmp)个人模板](/2009/92.md)
* [并查集 模板](/2009/91.md)
* [POJ 3267 The Cow Lexicon 解题报告](/2009/90.md)
* [C/C++语言常用排序算法](/2009/89.md)
* [POJ 2606 Rabbit hunt 2780 Linearity 1118 Lining Up 解题报告](/2009/88.md)
* [打造最快的Hash表(转) \[以暴雪的游戏的Hash为例\]](/2009/87.md)
* [ECUST 09年 校赛个人赛第六，七场总结](/2009/85.md)
* [ECUST 09年 校赛个人赛第三场部分解题报告(A,D,F,I)](/2009/84.md)
* [牛顿迭代解方程  ax^3+bX^2+cx+d=0](/2009/83.md)
* [09年8月9日 ECUST ACM 练习赛总结](/2009/82.md)
* [连接最多点直线 (OWenT 个人模板)](/2009/81.md)
* [点到直线距离 和 线段间最短距离 (OWenT 模板)](/2009/80.md)
* [ECUST 09年 校赛个人训练赛第五场总结](/2009/79.md)
* [ECUST 09年 校赛个人赛第八场（最后一场）总结](/2009/78.md)
* [09年8月14日 ECUST ACM 练习赛总结](/2009/77.md)
* [矩阵相关 (增强中)](/2009/76.md)
* [Prime最小生成树(个人模板)](/2009/75.md)
* [最长单调子序列 复杂度nlog(n)](/2009/74.md)
* [POJ PKU 2549 Sumsets 解题报告](/2009/69.md)
* [POJ PKU 3277 City Horizon 解题报告](/2009/67.md)
* [我的ACM生涯](/2009/66.md)
* [POJ PKU 2528 Mayor's posters 解题报告](/2009/65.md)
* [POJ PKU 2378 Tree Cutting 解题报告](/2009/64.md)
* [POJ PKU 1990 MooFest 解题报告](/2009/63.md)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://blog.owent.net/2009.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.