{"id":19867353,"url":"https://github.com/huzecong/oi-slides","last_synced_at":"2026-01-26T20:11:47.939Z","repository":{"id":53379897,"uuid":"237358915","full_name":"huzecong/oi-slides","owner":"huzecong","description":"我的信息学竞赛讲课课件","archived":false,"fork":false,"pushed_at":"2020-01-31T04:27:49.000Z","size":29242,"stargazers_count":1179,"open_issues_count":0,"forks_count":247,"subscribers_count":40,"default_branch":"master","last_synced_at":"2025-03-01T00:39:02.610Z","etag":null,"topics":["dynamic-programming","flow-networks","oi","oi-training"],"latest_commit_sha":null,"homepage":null,"language":"TeX","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/huzecong.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2020-01-31T04:20:19.000Z","updated_at":"2025-02-26T02:20:51.000Z","dependencies_parsed_at":"2022-08-26T13:00:46.162Z","dependency_job_id":null,"html_url":"https://github.com/huzecong/oi-slides","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/huzecong/oi-slides","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huzecong%2Foi-slides","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huzecong%2Foi-slides/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huzecong%2Foi-slides/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huzecong%2Foi-slides/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/huzecong","download_url":"https://codeload.github.com/huzecong/oi-slides/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huzecong%2Foi-slides/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28787161,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-26T13:55:28.044Z","status":"ssl_error","status_checked_at":"2026-01-26T13:55:26.068Z","response_time":59,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["dynamic-programming","flow-networks","oi","oi-training"],"created_at":"2024-11-12T15:29:06.967Z","updated_at":"2026-01-26T20:11:47.922Z","avatar_url":"https://github.com/huzecong.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"# oi-slides\n\n本仓库收集了我从2013至2018年的所有信息学竞赛讲课课件。本科期间靠讲课~~骗~~挣了一些钱，但考虑到之后大概不会再出去讲课，受 [Trinkle23897/oi_slides](https://github.com/Trinkle23897/oi_slides) 启发，在此公开。\n\n所有课件的使用时间和内容如下表所示。这其中以”题目选讲“命名的课件基本上都是斐波那契课件，由之前若干课件中的例题拼凑而成，没什么价值。许多课件在多次讲课中使用 ~~（反复骗钱）~~ ，此处上传的均为最近一次的修订版。\n\n| 时间                                                         | 名称                                                         | 内容                                                       |\n| ------------------------------------------------------------ | ------------------------------------------------------------ | ---------------------------------------------------------- |\n| 2013年3月                                                    | [TopCoder 题目选讲](2013-topcoder-problems/2013.3_Vijos集训_TopCoder题目选讲.pdf) | 如题。                                                     |\n| 2014年3月\u003cbr /\u003e2015年6月                                     | [CodeChef 题目选讲](2014-codechef-problems/slide.pdf)        | 如题。                                                     |\n| 2014年12月                                                   | [趣题选讲](2014-interesting-problems/slide.pdf)              | 如题。                                                     |\n| 2015年5月\u003cbr /\u003e2015年6月\u003cbr /\u003e2016年1月\u003cbr /\u003e2018年1月       | [网络流模型与例题 1](2015-flow-networks/网络流_final.pdf) [2](2015-flow-networks/备用1/网络流_进阶篇_final.pdf) [3](2015-flow-networks/备用2/网络流_进阶篇2.pdf) | 将常见的网络流模型分类，总结经验。算是我难得的良心课件。   |\n| 2015年10月\u003cbr /\u003e2016年1月\u003cbr /\u003e2016年11月\u003cbr /\u003e2017年6月\u003cbr /\u003e2018年5月 | [NOIp 图论](2015-noip-graph-theory/图论_final.pdf)           | NOIp水平的图论知识，包括最短路、最小生成树、强连通分量。   |\n| 2015年10月\u003cbr /\u003e2016年1月\u003cbr /\u003e2016年11月\u003cbr /\u003e2017年1月\u003cbr /\u003e2017年6月\u003cbr /\u003e2018年5月 | [NOIp 数学方法](2015-noip-math/数学方法_final.pdf)           | NOIp水平的数论及组合数学知识，以及位运算的运用。           |\n| 2016年1月                                                    | [数据结构及应用](2016-data-structures/数据结构.pdf)          | 高级数据结构入门知识，包括平衡树、动态树、分块。           |\n| 2016年5月\u003cbr /\u003e2017年1月                                     | [动态规划例题选讲](2016-dynamic-programming/slide.pdf)       | 一些省选和NOI水平的动态规划题。                            |\n| 2018年1月                                                    | [考试策略的人生经验](2018-contest-strategies/考试策略.pdf)   | 多年考试总结出的人生经验。可能是最有用的一个课件。         |\n| 2018年3月                                                    | [线性代数、概率与期望](2018-linear-algebra-and-probability/slide_final.pdf) | 线性代数和概率论的基础知识，以及在OI中省选水平的一些应用。 |","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuzecong%2Foi-slides","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhuzecong%2Foi-slides","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuzecong%2Foi-slides/lists"}