Работа со строками как с массивом символов

#include<stdio.h>
#include <stdlib.h>
#include <iostream.h>
#include <conio.h>
//using namespace std;
int ObrabotkaStroki (const char*, int&, int&, int&, int&);
int main()
{
const int N = 256;
char s[N];
int kolWords; 
int kolWordsA;
int NmaxWord;
int maxWord;
int posMaxWord;
do{
puts("\n\tVv stroky simvolov:");
gets(s);
puts("\n");
kolWords = ObrabotkaStroki(s,kolWordsA,NmaxWord,maxWord,posMaxWord);
printf("\nAmount of words:%d\n", kolWords);
if (kolWords)
{
printf ("The Longest word %d: %d of symbols\n", NmaxWord, maxWord);
printf("The Longest word is begun with positijn %d\n",posMaxWord);
printf("Amount of words with symbol 'a': %d\n", kolWordsA);
}
printf("\n\tTo continue? (y/Any key): ");
}
while (getch()=='y');
return EXIT_SUCCESS;
}
//****************************************************************
int ObrabotkaStroki (const char*s, int&kolWordsA, int&NmaxWord, int&maxWord, int&posMaxWord)
{
int flWord = 0;
int flA = 0;
int kolSymbolsWord = 0;
int posWord = 0;
int kolWords = 0;
kolWordsA =  0;
NmaxWord = maxWord = posMaxWord = 0;
for (int i = 0; s[i]!= '\0'; ++i)
{
if( s[i] != 'a')
{if(!flWord)posWord = i;
flWord = 1;
if (s[i] =='a') flA = 1;
++kolSymbolsWord;
}
else
{
if(flWord)
{
flWord = 0;
++kolWords;
printf("word%d:of symbols %d\n", kolWords, kolSymbolsWord);
if(kolSymbolsWord > maxWord)
{
maxWord = kolSymbolsWord;
NmaxWord = kolWords;
posMaxWord = posWord;
}
kolSymbolsWord = 0;
if(flA) {++kolWordsA; flA = 0;}
}
}
}
if(flWord)
{
++kolWords;
if(flA)++kolWordsA;
if(kolSymbolsWord > maxWord)
{
maxWord = kolSymbolsWord;
NmaxWord = kolWords;
posMaxWord = posWord;
}
printf("Word%d:of symbols %d\n", kolWords, kolSymbolsWord);
}
getchar();
return kolWords;
}

int main()
{
return 0;
}