UVa 12543 - Longest Word Solution

#include<iostream>
#include<cstdio>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>
#include<deque>
#include<iterator>
#include<assert.h>
#include<bitset>
#include<climits>
#include<ctime>
#include<complex>

using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define CLR(a) memset(a,0,sizeof(a))
#define PB push_back
#define PI acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define READ freopen("input.txt", "r", stdin)
#define WRITE freopen("output.txt", "w", stdout)
#define LL long long

#define S(a) scanf("%d",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define KS printf("Case %d: ",kk++)

#define MOD 1000000007
#define MX 100010

int main()
{
    int mx=0,cnt;
    string s,res;
    while(cin>>s)
    {
        if(s=="E-N-D") break;
        cnt=0;
        int sl=s.size();
        for(int i=0;i<sl;i++)
            if(isalpha(s[i]) || s[i]=='-')
                cnt++;
        if(cnt>mx)
        {
            res=s;
            mx=cnt;
        }
    }
    int rl=res.size();
    for(int i=0;i<rl;i++)
        if(isalpha(res[i]) || res[i]=='-')
        {
            if(res[i]>='A' && res[i]<='Z')  res[i]=res[i]-'A'+'a';
            cout<<res[i];
        }
    cout<<endl;
    return 0;
}