在网上看到一个算法题,https://blog.csdn.net/universe_ant/article/details/70941838,这里用递归的思想做一下,思路可能更清晰一些。
题目描述:
A、B、C、D、E五个学校,A说E是第一,B说B是第二,C说A是最差的,D说C不是最好的,E说D是最好的。只有第一和第二名说的是对的,其他说的都是错的,请编程确定五个学校的名次。
思路分析:
1、建模:使用map<int, char> schoolSort 表示排名对应的学校,map<char, bool> talks表示学校的言论以及正确性。
2、分割问题:首先对五个学校进行全排列,依次枚举出各种情况,然后对各种情况进行分析。
代码:
#include <iostream>
#include <string>
#include <map>
using namespace std;
map<int, char> schoolSort;
map<char, bool> talks;
string schools = "ABCDE";
void Init(){
for (int i=1; i<=5; i++)
{
char s = 'A' + i -1;
schoolSort.insert(pair<int, char>(i, s));
talks.insert(pair<char, bool>(s, false));
}
}
bool JudgeTalks(){
talks['A'] = schoolSort[1]== 'E';
talks['B'] = schoolSort[2]== 'B';
talks['C'] = schoolSort[5]== 'A';
talks['D'] = schoolSort[1]!= 'C';
talks['E'] = schoolSort[1]== 'D';
if (!talks[schoolSort[1]] || !talks[schoolSort[2]])
return false;
map<char, bool>::iterator iter;
int sum = 0;
for (iter = talks.begin(); iter!=talks.end(); iter++)
{
if(iter->second == true)
sum ++;
}
if (sum == 2)
return true;
return false;
}
bool SortSchool(int start, int end){
if(start > end)
return JudgeTalks();
for (int i=0; i!= schools.size(); i++)
{
if(schools[i] == 'x')
continue;
char tmp = schools[i];
schoolSort[start] = tmp;
schools[i] = 'x';
if(SortSchool(start+1, end))
return true;
schools[i] = tmp;
}
return false;
}
int main(){
if (SortSchool(1, 5))
{
map<int, char>::iterator iter;
for (iter = schoolSort.begin(); iter!=schoolSort.end(); iter++)
{
cout<<iter->second;
}
}
else
{
cout<<"No eligible result!";
}
return 0;
}