田忌赛马.zip_田忌赛马_田忌赛马 贪心_田忌赛马问题

#include<iostream> #include<algorithm> using namespace std; template<class T> int length(T& arr) { //cout << sizeof(arr[0]) << endl; //cout << sizeof(arr) << endl; return sizeof(arr) / sizeof(arr[0]); } int main() { /*cout << "请输入田忌与齐王马的数量："; int len; cin >> len; int tianji[1005]; int qiwang[1005]; cout << "请输入田忌马的速度："; for (int i = 0; i < len; i++) { cin >> tianji[i]; } cout << "请输入齐王马的速度："; for (int i = 0; i < len; i++) { cin >> qiwang[i]; }*/ int tianji[5] = { 1,2,3,4,5 }; int qiwang[5] = { 1,2,3,4,6 }; int len = length(tianji); cout << " 田忌马的速度："; for (int i = 0; i < len;i++) { cout << tianji[i]; } cout << endl<<" 齐王马的速度："; for (int i = 0; i < len; i++) { cout << qiwang[i]; } cout << endl; sort(tianji,tianji+len); sort(qiwang, qiwang + len); int count_win = 0, count = 0,tianji_zuihou=len, tianji_zuiqian = 0, qiwang_zuihou = len, qiwang_zuiqian = 0; while (count != len) { if (tianji[tianji_zuihou-1] > qiwang[qiwang_zuihou -1]) { count_win += 1; tianji_zuihou -= 1; qiwang_zuihou -= 1; } else if (tianji[tianji_zuihou - 1] < qiwang[qiwang_zuihou - 1]) { qiwang_zuihou -= 1; tianji_zuiqian += 1; } else { if (tianji[tianji_zuiqian] > qiwang[qiwang_zuiqian]) { count_win += 1; tianji_zuiqian += 1; qiwang_zuiqian += 1; } else if (tianji[tianji_zuiqian] <= qiwang[qiwang_zuiqian]) { tianji_zuiqian += 1; qiwang_zuihou -= 1; } } count += 1; } cout << "田忌共赢"<<count_win<<"局"; return 0; }