UVA 12543 Longest Word 解题报告

//Time:15ms
//Memory:0KB
//Length:755B
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define MAXN 1010
#define MAXM 100010
char str[MAXN],ans[MAXN];
int main()
{
int len=0;
//freopen("/home/moor/Code/input","r",stdin);
while(scanf("%s",str))
{
if(strcmp(str,"E-N-D")==0)  break;
for(int i=0;str[i];++i)
if(str[i]>='A'&&str[i]<='Z')
str[i]+=32;
for(int i=0,j;str[i];)
{
for(j=i;str[j];++j)
if(str[j]!='-'&&(str[j]<'a'||str[j]>'z'))
break;
if(len<j-i)
strncpy(ans,&str[i],j-i),len=j-i;
i=j+1;
if(!str[j]) break;
}
}
printf("%s\n",ans);
return 0;
}