fork download 
  1. #include<iostream>
  2. #include<cmath>
  3. #include<algorithm>
  4. #include<iomanip>
  5. #include<climits>
  6. #include<numeric>
  7. #include<set>
  8. #include<sstream>
  9. #include<map>
  10. #include<vector>
  11. #include<string>
  12.  
  13. using namespace std;
  14.  
  15. vector<string> split(string haystack, string needle) {
  16. 	vector<string> result;
  17. 	int start_pos = 0;
  18. 	int found_pos = haystack.find(needle, start_pos);
  19. 	while (found_pos != string::npos) {
  20. 		int count = found_pos - start_pos;
  21. 		string token = haystack.substr(start_pos, count);
  22. 		if (!token.empty()) {
  23. 			result.push_back(token);
  24. 		}
  25. 		start_pos = found_pos + needle.length();
  26. 		found_pos = haystack.find(needle, start_pos);
  27. 	}
  28. 	string token = haystack.substr(start_pos, haystack.length()-start_pos);
  29. 	if (!token.empty()) {
  30. 		result.push_back(token);
  31. 	}
  32. 	return result;
  33. }
  34. string nameConvert(const string& name) {
  35. 	const string DELIMITER = " ";
  36. 	stringstream builder;
  37. 	auto parts = split(name, DELIMITER);
  38. 	for (auto part : parts) {
  39. 		part[0] = toupper(part[0]);
  40. 		transform(part.begin()+1, part.end(),part.begin()+1, ::tolower);
  41. 		builder << part << DELIMITER;
  42. 	}
  43. 	return builder.str();
  44. }
  45. string dateConvert(const string& date) {
  46. 	const string DELIMITER = "/";
  47. 	stringstream builder;
  48. 	auto parts = split(date, DELIMITER);
  49. 	builder << setw(2) << setfill('0') << parts[0] << DELIMITER;
  50. 	builder << setw(2) << setfill('0') << parts[1] << DELIMITER;
  51. 	builder << parts[2];
  52. 	return builder.str();
  53.  
  54. }
  55.  
  56. int main() {
  57. 	string s;cin >> s;
  58. 	string maxResult = "";
  59. 	maxResult.push_back(s[0]);
  60.  
  61. 	string currentResult = "";
  62. 	currentResult.push_back(s[0]);
  63.  
  64. 	for (int i = 1;i < s.size();i++) {
  65. 		if (s[i] != s[i - 1]) {
  66. 			currentResult = currentResult + s[i];
  67. 		}
  68. 		else {
  69. 			if (currentResult.size() > maxResult.size()) {
  70. 				maxResult = currentResult;
  71. 			}
  72. 			else if (currentResult.size() == maxResult.size()) {
  73. 				maxResult = max(maxResult, currentResult);
  74. 			}
  75. 			currentResult = "";
  76. 			currentResult.push_back(s[i]);
  77. 		}
  78. 	}
  79. 	if (currentResult.size() > maxResult.size()) {
  80. 		maxResult = currentResult;
  81.  
  82. 	}
  83. 	else if (currentResult.size() == maxResult.size()) {
  84. 		maxResult = max(maxResult, currentResult);
  85. 	}
  86. 	cout << maxResult;
  87.  
  88. }
  89.  
  90.  
Success #stdin #stdout 0s 5288KB
comments (?)
stdin 
Standard input is empty
stdout 

	

		
	 
	
	
			

					
			
			
			
			
			
			
			
			

			
			
			
		

	
		
		

			


			                        
			
			

				

	
					
					 https://ideone.com/CMjlqh
					
					
					
					
					

												

												
						
						

					

					
					
					

						
language:

						
C++ (gcc 8.3)

					

					

						
created:
								
						
9 hours 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!