fork download
copy 
  1. #include <iostream>
  2. #include <algorithm>
  3. using namespace std;
  4.  
  5. int main() {
  6. 	char c[100001] ,kilani[10]={'k','i','l','a','n','i'};
  7. 	int cur=-1,n ,count=0,ans=0; 
  8. 	cin >> n ; 
  9. 	for (int i=0; i<n;i++)
  10. 	{
  11. 		cin >> c[i] ; 
  12. 	}
  13. 	for(int i=0 ; i<n ;i++)
  14. 	{
  15. 		if(cur==-1)
  16. 		if(c[i]=='k')
  17. 		{
  18. 		cur=i;
  19. 	//	cout<<'*';	
  20. 		}
  21.  
  22. 		if(cur!=-1)
  23.  
  24. 		if(c[i]==kilani[(i-cur)])
  25. 		{
  26. 			if(c[i]=='i'&&(i-cur)==5)
  27. 		{
  28. 			count++;
  29. 			ans=max(ans,count);
  30. 			cur=-1;
  31. 			if(c[i+1]!='k')
  32. 			count=0; 
  33. 		}
  34. 		}
  35. 		else
  36. 		{
  37. 		cur=-1; 
  38. 		count=0;
  39. 		}
  40.  
  41. 	}
  42. 	cout << ans ; 
  43. 	return 0;
  44. }
Success #stdin #stdout 0s 4556KB
comments (?)
stdin
copy 
28
kilanijfjfjkilanikilanikilai
stdout
copy 
2
https://ideone.com/YFTgdU
language:
C++ (gcc 8.3)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!