sort函数(cmp)、map用法---------------Tju_Oj_2312Help Me with the Game

这道题里主要学习了sort函数、sort的cmp函数写法、C++的map用法（其实和数组一样）

Your task is to read a picture of a chessboard position and print it in the chess notation.

Input Specification

The input consists of an ASCII-art picture of a chessboard with chess pieces on positions described by the input. The pieces of the white player are shown in upper-case letters, while the black player's pieces are lower-case letters. The letters are one of "K" (King), "Q" (Queen), "R" (Rook), "B" (Bishop), "N" (Knight), or "P" (Pawn). The chessboard outline is made of plus ("+"), minus ("-"), and pipe ("|") characters. The black fields are filled with colons (":"), white fields with dots (".").

Output Specification

The output consists of two lines. The first line consists of the string "White: ", followed by the description of positions of the pieces of the white player. The second line consists of the string "Black: ", followed by the description of positions of the pieces of the black player.

The description of the position of the pieces is a comma-separated list of terms describing the pieces of the appropriate player. The description of a piece consists of a single upper-case letter that denotes the type of the piece (except for pawns, for that this identifier is omitted). This letter is immediatelly followed by the position of the piece in the standard chess notation -- a lower-case letter between "a" and "h" that determines the column ("a" is the leftmost column in the input) and a single digit between 1 and 8 that determines the row (8 is the first row in the input).

The pieces in the description must appear in the following order: King("K"), Queens ("Q"), Rooks ("R"), Bishops ("B"), Knights ("N"), and pawns. Note that the numbers of pieces may differ from the initial position because of capturing the pieces and the promotions of pawns. In case two pieces of the same type appear in the input, the piece with the smaller row number must be described before the other one if the pieces are white, and the one with the larger row number must be described first if the pieces are black. If two pieces of the same type appear in the same row, the one with the smaller column letter must appear first.

Sample Input

+---+---+---+---+---+---+---+---+
|.r.|:::|.b.|:q:|.k.|:::|.n.|:r:|
+---+---+---+---+---+---+---+---+
|:p:|.p.|:p:|.p.|:p:|.p.|:::|.p.|
+---+---+---+---+---+---+---+---+
|...|:::|.n.|:::|...|:::|...|:p:|
+---+---+---+---+---+---+---+---+
|:::|...|:::|...|:::|...|:::|...|
+---+---+---+---+---+---+---+---+
|...|:::|...|:::|.P.|:::|...|:::|
+---+---+---+---+---+---+---+---+
|:P:|...|:::|...|:::|...|:::|...|
+---+---+---+---+---+---+---+---+
|.P.|:::|.P.|:P:|...|:P:|.P.|:P:|
+---+---+---+---+---+---+---+---+
|:R:|.N.|:B:|.Q.|:K:|.B.|:::|.R.|
+---+---+---+---+---+---+---+---+

Sample Output

White: Ke1,Qd1,Ra1,Rh1,Bc1,Bf1,Nb1,a2,c2,d2,f2,g2,h2,a3,e4
Black: Ke8,Qd8,Ra8,Rh8,Bc8,Ng8,Nc6,a7,b7,c7,d7,e7,f7,h7,h6
代码：

 /*
  * 2312_Help Me with the Game.cpp
  *
  *  Created on: 2018年10月23日
  *      Author: Jeaosn
  */

 #include <iostream>
 #include <stdlib.h>
 #include <stdio.h>
 #include <string>
 #include <cstring>
 #include <algorithm>
 #include <vector>
 #include <map>
 #include <sstream>
 using namespace std;

 map< char , int > mymap;
 map< int , string > column;
 char chess[][];
 vector<string> white_KQRBN;
 vector<string> white_P;
 vector<string> black_KQRBN;
 vector<string> black_P;

 string num2str(int i)
 {
     stringstream ss;
     ss<<i;
     return ss.str();
 }

 bool cmp_white_KQRBN(string a ,string b){
     if(a[] == b[]){
         if(a[] == b[])
             return a[] < b[];   //如果第一位第三位相同，按照第二位升序
         return a[] < b[];         //如果第一位相同，第三位升序排列
     }
     return mymap[a[]] < mymap[b[]];   //首先按照首位升序
 }

 bool cmp_black_KQRBN(string a ,string b){
     if(a[] == b[]){
         if(a[] == b[])
             return a[] < b[];   //如果第一位第三位相同，按照第二位升序
         return a[] > b[];         //如果第一位相同，第三位升序排列
     }
     return mymap[a[]] < mymap[b[]];   //首先按照首位升序
 }

 bool cmp_white_P(string a ,string b){
     if(a[] == b[]){
         return a[] < b[];         //如果第一位相同，第三位升序排列
     }
     return a[] < b[];   //首先按照第二位升序
 }

 bool cmp_black_P(string a ,string b){
     if(a[] == b[]){
         return a[] < b[];         //如果第一位相同，第三位升序排列
     }
     return a[] > b[];   //首先按照第二位升序
 }

 int main()
 {
     mymap['K'] = ;mymap['Q'] = ;mymap['R'] = ;mymap['B'] = ;mymap['N'] = ;
     column[] = "a";column[] = "b";column[] = "c";column[] = "d";
     column[] = "e";column[] = "f";column[] = "g";column[] = "h";

     for(int i =  ;i >= ; i--)
         for(int j =  ;j <= ; j++)
             cin >> chess[i][j];

     for(int i =  ;i <= ; i+=){
         for(int j =  ;j <= ; j+=){
             if(chess[i][j] == 'K')
                 white_KQRBN.push_back( "K" + column[ (j/)+ ] + num2str(i/) );
             if(chess[i][j] == 'Q')
                 white_KQRBN.push_back( "Q" + column[ (j/)+ ] + num2str(i/) );
             if(chess[i][j] == 'R')
                 white_KQRBN.push_back( "R" + column[ (j/)+ ] + num2str(i/) );
             if(chess[i][j] == 'B')
                 white_KQRBN.push_back( "B" + column[ (j/)+ ] + num2str(i/) );
             if(chess[i][j] == 'N')
                 white_KQRBN.push_back( "N" + column[ (j/)+ ] + num2str(i/) );
             if(chess[i][j] == 'P')
                 white_P.push_back( column[ (j/)+ ] + num2str(i/) );

             if(chess[i][j] == 'k')
                 black_KQRBN.push_back( "K" + column[ (j/)+ ] + num2str(i/) );
             if(chess[i][j] == 'q')
                 black_KQRBN.push_back( "Q" + column[ (j/)+ ] + num2str(i/) );
             if(chess[i][j] == 'r')
                 black_KQRBN.push_back( "R" + column[ (j/)+ ] + num2str(i/) );
             if(chess[i][j] == 'b')
                 black_KQRBN.push_back( "B" + column[ (j/)+ ] + num2str(i/) );
             if(chess[i][j] == 'n')
                 black_KQRBN.push_back( "N" + column[ (j/)+ ] + num2str(i/) );
             if(chess[i][j] == 'p')
                 black_P.push_back( column[ (j/)+ ] + num2str(i/) );
         }
     }
     sort(white_KQRBN.begin() , white_KQRBN.end()  ,cmp_white_KQRBN);
     sort(black_KQRBN.begin() , black_KQRBN.end()  ,cmp_black_KQRBN);
     sort(white_P.begin() , white_P.end() ,cmp_white_P);
     sort(black_P.begin() , black_P.end() ,cmp_black_P);

     cout << "White: ";
     for(int i = ;i < white_KQRBN.size();i++){
         cout << white_KQRBN[i] << ",";
     }
     for(int i = ;i < white_P.size();i++){
         if(i == (white_P.size() - ))
             cout << white_P[i] << endl;
         else
             cout << white_P[i] << ",";
     }

     cout << "Black: ";
     for(int i = ;i < black_KQRBN.size();i++){
         cout << black_KQRBN[i] << ",";
     }
     for(int i = ;i < black_P.size();i++){
         if(i == (black_P.size() - ) )
             cout << black_P[i] << endl;
         else
             cout << black_P[i] << ",";
     }
     return ;
 }

这道题里主要学习了sort函数、sort的cmp函数写法、C++的map用法（其实和数组一样）