LeetCode/Count_Number_of_Teams.cpp at master · Wilson1211/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;

// https://leetcode.com/problems/count-number-of-teams/description/

vector<int> nums;
vector<int>ans;

int ans_count;

void pn(int ind, int place, int n, int dir) {
    for(int i=ind;i<n;i++) {
        if(place==1){
            ans.clear();
            ans.emplace_back(nums[i]);
            pn(i+1, 2, n, dir);
            ans.pop_back();
            //ans_down.emplace_back(nums[i]);
            //pn(++ind, 2, n);
            //ans_down.pop_back();
        }else if(place==2){
            if((nums[i]>ans[0]) && (dir == 1)){
                ans.emplace_back(nums[i]);
                pn(i+1, 3, n, dir);
                ans.pop_back();
            }else if((nums[i]<ans[0]) && (dir == -1)){
                ans.emplace_back(nums[i]);
                pn(i+1, 3, n, dir);
                ans.pop_back();
            }
        }else{
            if((dir == 1)&&(nums[i]>ans[1])){
                cout<<ans[0]<<" "<<ans[1]<<" "<<nums[i]<<endl;
                ans_count++;
            }else if((dir == -1)&&(nums[i]<ans[1])){
                cout<<ans[0]<<" "<<ans[1]<<" "<<nums[i]<<endl;
                ans_count++;
            }
        }
    }
}

int main() {
    int i, j, k;
    string line;

    getline(cin, line);
    istringstream iss(line);
    while(iss>>k){
        nums.emplace_back(k);
    }

    k = nums.size();
    ans_count = 0;

   // pn(0, 1, k, 1);
   // pn(0, 1, k, -1);

    //cout<<ans_count<<endl;

    for(i=0;i<n;i++){
        ans.emplace_back(nums[i]);
        for(j=i;j<)
    }

    return 0;

}