1-13
read a word , EOF to stop
if the word is ' ' or '/t' or '/n'
if the pre state is IN
push count to a[i]
add i once
count=0
if the word is not a ' ' and '/t' and '/n'
if the pre state is OUT
update the state to IN
add count once
update lasts to state
1-14