Divid and Conquer.ppt

Divide and Conquer Lecture by Hao Wu 一般方法 Master Theorem T(n)=aT(n/b)+f(n) 常见分治法 二分法 三分法 二分搜索 案例1：Babelfish Time Limit: 3000MS Memory Limit: 65536K Description You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them. Input Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters. Output Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as eh. Sample Input dog ogday cat atcay pig igpay froot ootfray loops oopslay atcay ittenkay oopslay Sample Output cat eh loops 解题思路 二分查找 因为字典的规模达到100,000的规模，使用线性查找时间肯定不行 核心代码 typedef struct{char src[20],tag[20];}Dict; int cmp(Dict *a,Dict *b){ Return strcmp((*a).tag,(*b).tag);} int BS(int b,int e,char *s){ If (b0||e=n||be||b==estrcmp(D[s].tag,s)) Return -1; int m=(s+e)/2; If (strcmp(D[m].tag,s)==0)return m; If (strcmp(D[m].tag,s)0)return BS(m+1,e,s); return BS(b,m-1,s);} 核心代码(续) int main(){ qsort(D,n,sizeof(D[0]),cmp); while(scanf(“%s”,s)!=EOF) printf(“%s\n”,(r=BS(0,n-1,s))==-1?”eh”:D[r]); Return 0;} 案例6：Raising Modulo Numbers Time Limit:1000MS? Memory Limit:30000K Description People are different. Some secretly read magazines full of interesting girls pictures, others create an A-bomb in their cellar, others like using Windows, and some like difficult mathematical games. Latest marketing research shows, that this market segment was so far underestimated and that there is lack of such games. This kind of game was thus included i