# POJ1064 Cable master

## Description

Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to connect computers for the contestants using a "star" topology - i.e. connect them all to a single central hub. To organize a truly honest contest, the Head of the Judging Committee has decreed to place all contestants evenly around the hub on an equal distance from it.

# lower_bound()和upper_bound()的使用

## Description

Jessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she wants to pass it, she has to master all ideas included in a very thick text book. The author of that text book, like other authors, is extremely fussy about the ideas, thus some ideas are covered more than once. Jessica think if she managed to read each idea at least once, she can pass the exam. She decides to read only one contiguous part of the book which contains all ideas covered by the entire book. And of course, the sub-book should be as thin as possible.

# POJ3061 Subsequence

## Description

A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of the subsequence of consecutive elements of the sequence, the sum of which is greater than or equal to S.

# POJ2456 Aggressive cows

## Description

Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,...,xN (0 <= xi <= 1,000,000,000).

# 编译原理 第一章 绪论

## 1.1 编译程序简介

• 机器语言（Machine Language）
• 难记忆、难编写、难阅读、难改错
• 计算机可直接理解
• 例：C706 0000 0002
• 汇编语言（Assembly Language）
• 引入助记符
• 依赖特定机器
• 编写效率低
• 例：MOV X,2
• 高级语言（High-level Language）
• 接近人类表达习惯，不依赖特定机器
• 编写效率高
• 例：x = 2