hdu 2572 优先队列

  1. #include <iostream>
  2. #include <string>
  3. #include <algorithm>
  4. #include <queue>
  5. #define max_one 100
  6. #define max_two 50
  7. #define max_three 50
  9. using namespace std;
  10. struct node												//structure must sign first 
  11. {
  12. 	string str;
  13. 	int size;
  14. 	
  15. };
  18. struct cmp											//return the most minimum string
  19. 													//pay attention :
  20. 													//must complete size first then complete string 
  21. {
  22. 	bool operator() (const node &a, const node &b)
  23. 	{
  24. 		if(a.size >b.size)
  25. 		return true;
  26. 		else if(a.size ==b.size)
  27. 			return a.str>b.str;
  28. 		else return false;
  29. 	}
  30. };
  32. priority_queue <node, vector<node>, cmp> que;
  35. void score_string(char *p, char *q, int two, int three)				//score string into queue 
  36. {
  37. 	string temp="";
  38. 	if(p>q)
  39. 	{
  40. 		int length=three > p-q+two ? three : p-q+two;
  41. 		for(int i=0; i<length ;i++)
  42. 			temp+=*(q+i);
  43. 		node a;
  44. 		a.str=temp;
  45. 		a.size=length;
  46. 		que.push(a);
  47. 	}
  48. 	else if(p<q)
  49. 	{
  50. 		int length=two > q-p+three ? two : q-p+three;
  51. 		for(int i=0; i<length ;i++)
  52. 			temp+=*(p+i);
  53. 		node a;
  54. 		a.str=temp;
  55. 		a.size=length;
  56. 		que.push(a);
  57. 	}
  58. 	else if(p=q)											//pay attention : p=q such as this string
  59. 															//one :asdfgh	two :asdfgh  three:a;
  60. 	{
  61. 		int length=two >three ? two :three;
  62. 		for(int i=0; i<length ;i++)
  63. 			temp+=*(p+i);
  64. 		node a;
  65. 		a.str=temp;
  66. 		a.size=length;
  67. 		que.push(a);
  68. 	}
  69. }
  71. int main()
  72. {
  73. 	int T;
  74. 	cin>>T;
  75. 	while(T--)
  76. 	{
  77. 		while(!que.empty() )									//each text must clean the queue 
  78. 		{
  79. 			que.pop();
  80. 		}
  81. 		char one[max_one],two[max_two],three[max_three];
  82. 		cin>>one>>two>>three;
  83. 		int two_length=strlen(two);							//score size of two three string 
  84. 		int three_length=strlen(three);
  85. 		char *p=strstr(one,two);
  86. 		char *q=strstr(one,three);
  87. 		if(p==NULL ||q==NULL)
  88. 		cout<<"No"<<endl;
  89. 		else
  90. 		{
  91. 			char *two_point[max_two];						//set pointer array score the possible way of string 
  92. 			char *three_point[max_three];
  93. 			two_point[0]=p;three_point[0]=q;
  94. 			int size_two=1;
  95. 			char *temp_two=p,*temp_three=q;
  96. 			while( (temp_two=strstr(temp_two+1,two))!=NULL)					//get different substring way
  97. 				two_point[size_two++]=temp_two;
  98. 			int size_three=1;
  99. 			while( (temp_three=strstr(temp_three+1,three))!=NULL)
  100. 				three_point[size_three++]=temp_three;
  101. 			for(int i=0; i<size_two; i++)					//score 
  102. 			{
  103. 				for(int j=0; j<size_three; j++)
  104. 					score_string(two_point[i], three_point[j], two_length, three_length);
  105. 			}
  106. 			cout<<que.top().str<<endl;
  107. 		}
  108. 		//cout<<que.top().str<<endl;
  109. 		
  110. 	}
  111. 	return 0;
  112. }





附件列表

    【推广】 免费学中医，健康全家人
    原文地址：https://www.cnblogs.com/sober-reflection/p/79c7d7830b0eb8580ab917fa8cdf1775.html