UVA 10815 - Andy's First Dictionary

Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thinking up all the words himself, he has a briliant idea. From his bookshelf he would pick one of his favourite story books, from which he would copy out all the distinct words. By arranging the words in alphabetical order, he is done! Of course, it is a really time-consuming job, and this is where a computer program is helpful.
You are asked to write a program that lists all the different words in the input text. In this problem, a word is defined as a consecutive sequence of alphabets, in upper and/or lower case. Words with only one letter are also to be considered. Furthermore, your program must be CaSe InSeNsItIvE. For example, words like "Apple", "apple" or "APPLE" must be considered the same.
Input
The input file is a text with no more than 5000 lines. An input line has at most 200 characters. Input is terminated by EOF.
Output
Your output should give a list of different words that appears in the input text, one in a line. The words should all be in lower case, sorted in alphabetical order. You can be sure that he number of distinct words in the text does not exceed 5000.
Sample Input
Adventures in Disneyland

Two blondes were going to Disneyland when they came to a fork in the
road. The sign read: "Disneyland Left."

So they went home.
Sample Output
a
adventures
blondes
came
disneyland
fork
going
home
in
left
read
road
sign
so
the
they
to
two
went
were

when

题意： 输入一段英文句子，将句子中的单词提取出来，比较一下每一个单词的小写形式的大小，去重之后，再按字典序排列。

  思路：

主要是字符串输入这块很麻烦，输入之后，遇到空格或其他字母的时候，就划分为一个单词，并在输入的时候i记得将该字符转化为小写字母，将这个单词和之前已经排好序的字符串比较，若和之前的重了的话，就掠过，

如果没重，就按字典序排好顺序在正确的位置插入，最后输出字符串。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <iomanip>
//#include <ctype.h>
//#include <cctype>
using namespace std;
char word[5000][200];
char cur[200];
int main(void)
{
   // freopen("C.txt","r",stdin);
    int flag=0;
    char c;
    int n=0;
    int l=0;
    while((c=getchar())!=EOF)
    {
        if(isalpha(c))
            {
                cur[n++]=tolower(c);
                flag=1;
            }
            else
            {
                if(flag)
                {
                    cur[n]='\0';
                    n=0;
                    flag=0;
                    if(l==0)
                        strcpy(word[l++],cur);
                    else
                    {
                        int j=0;

                        while(strcmp(cur,word[j])>0&&j<l)
                            j++;
                            if(strcmp(word[j],cur)==0)
                            continue;
                            if(j==l)
                               {
                                    strcpy(word[l],cur);
                                       l++;
                               }
                               else
                               {
                                     for(int k=l;k>j;k--)
                                       strcpy(word[k],word[k-1]);
                                      strcpy(word[j],cur);
                                           l++;
                               }
                    }
                }
                else
                    continue;
            }
    }

    for(int j=0;j<l;j++)
          printf("%s\n",word[j]);


    return 0;

}