我发现了一个较严重问题，就是听不懂大佬说的一些名词，感受到了莫名的恐惧？？？于是我从网上找了一些术语，写在这里。
OJ平台
| 简写 | 全称 | 中文称谓 |
|---|---|---|
| OJ | Online Judge | 在线判题系统 |
| AC | Accepted | 通过 |
| WA | Wrong Answer | 答案错误 |
| TLE | Time Limit Exceed | 超时 |
| OLE | Output Limit Exceed | 超过输出限制 |
| MLE | Memory Limit Exceed | 超内存 |
| RE | Runtime Error | 运行时错误 |
| PE | Presentation Error | 格式错误 |
| CE | Compile Error | 无法编译 |
算法常用术语英中对照
| 英语 | 中文 |
|---|---|
| Approximate String Matching | 模糊匹配 |
| Arbitrary Precision Arithmetic | 高精度计算 |
| Bandwidth Reduction | 带宽压缩 |
| Bin Packing | 装箱问题 |
| Calendrical Calculations | 日期 |
| Clique | 最大团 |
| Combinatorial Problems | 组合问题 |
| Computational Geometry | 计算几何 |
| Connected Components | 连通分支 |
| Constrained and Unconstrained Optimization | 最值问题 |
| Convex Hull | 凸包 |
| Cryptography | 密码 |
| Data Structures | 基本数据结构 |
| Determinants and Permanents | 行列式 |
| Dictionaries | 字典 |
| Discrete Fourier Transform | 离散Fourier变换 |
| Drawing Graphs Nicely | 图的描绘 |
| Drawing Trees | 树的描绘 |
| Edge and Vertex Connectivity | 割边/割点 |
| Edge Coloring | 边染色 |
| Eulerian Cycle / Chinese Postman Euler | 回路/中国邮路 |
| Factoring and Primality Testing | 因子分解/质数判定 |
| Feedback Edge/Vertex Set | 最大无环子图 |
| Finite State Machine Minimization | 有穷自动机简化 |
| Generating Graphs | 图的生成 |
| Generating Partitions | 划分生成 |
| GeneratingPermutations | 排列生成 |
| GeneratingSubsets | 子集生成 |
| Graph Data Structures | 图形数据结构 |
| Graph Isomorphism | 图同构 |
| Graph Partition | 图的划分 |
| Graph Problems — hard | 图论-NP问题 |
| Graph Problems — polynomial | 图论-多项式算法 |
| Hamiltonian Cycle Hamilton | 回路 |
| Independent Set | 独立集 |
| Intersection Detection | 碰撞测试 |
| Job Scheduling | 工程安排 |
| Kd-Trees | 线段树 |
| Knapsack Problem | 背包问题 |
| Linear Programming | 线性规划 |
| Longest Common Substring | 最长公共子串 |
| Maintaining Line Arrangements | 平面分割 |
| Matching | 匹配 |
| Matrix Multiplication | 矩阵乘法 |
| Medial-Axis Transformation | 中轴变换 |
| Median and Selection | 中位数 |
| Minimum Spanning Tree | 最小生成树 |
| Minkowski Sum | Minkowski和 |
| Motion Planning | 运动规划 |
| Nearest Neighbor Search | 最近点对查询 |
| Network Flow | 网络流 |
| Numerical Problems | 数值问题 |
| Planarity Detection and Embedding | 平面性检测和嵌入 |
| Point Location | 位置查询 |
| Polygon Partitioning | 多边形分割 |
| Priority Queues | 优先队列 |
| Random Number Generation | 随机数生成 |
| Range Search | 范围查询 |
| rate of convergence | 收敛速度 |
| robustness | 鲁棒性 |
| Satisfiability | 可满足性 |
| Searching | 查找 |
| Set and String Problems | 集合与串的问题 |
| Set Cover | 集合覆盖 |
| Set Data Structures | 集合 |
| Shape Similarity | 相似多边形 |
| Shortest Common Superstring | 最短公共父串 |
| Shortest Path | 最短路径 |
| Simplifying Polygons | 多边形化简 |
| Solving Linear Equations | 线性方程组 |
| Sorting | 排序 |
| Steiner Tree | Steiner树 |
| String Matching | 模式匹配 |
| Text Compression | 压缩 |
| Topological Sorting | 拓扑排序 |
| Transitive Closure and Reduction | 传递闭包 |
| Traveling Salesman Problem | 旅行商问题 |
| Triangulation | 三角剖分 |
| Vertex Coloring | 点染色 |
| Vertex Cover | 点覆盖 |
| Voronoi Diagrams | Voronoi图 |
