SRM453 div2 medium
int find(vectortable) { int team = table.size(); vector win(team, 0); //count win number for(int i = 0; i < team; i++) { for(int j = 0; j < team; j++) { char ch = table[i][j]; if(ch == 'W') win[i]++; if(ch == 'L') win[j]++; } } for(int i = 0; i < team; i++) { for(int j = 0; j < team; j++) { if(table[i][j] == '?') { (win[i] >= win[j]) ? ++win[j] : ++win[i]; } } } return *max_element(win.begin(), win.end()); } //貪欲法で