23162023-01-10 12:32:50rennRobotokcpp11Accepted 50/5037ms5780 KiB
#include <bits/stdc++.h>
using namespace std;

#define InTheNameOfGod cin.tie(0); ios::sync_with_stdio(0);

typedef pair<int, int> pii;

int main()
{
    InTheNameOfGod

    int sor, oszlop, pont;
    cin >> sor >> oszlop >> pont;

    
    vector<pii> pontok(pont);
    int a, b;
    for(int i = 0; i < pont; ++i){
        cin >> a >> b;
        pontok[i] = {a, b};
    }
    sort(pontok.begin(), pontok.end());

    vector<int> indulok;
    vector<int>::iterator ind;
    for(auto akt : pontok){
        akt.second *= -1;
        ind = lower_bound(indulok.begin(), indulok.end(), akt.second);
        if(ind == indulok.end()){
            indulok.push_back(akt.second);
        }
        else{
            *ind = akt.second;
        }
    }

    cout << indulok.size();
    
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/03ms1832 KiB
2Accepted0/032ms3228 KiB
3Accepted2/22ms2224 KiB
4Accepted2/22ms2452 KiB
5Accepted2/22ms2508 KiB
6Accepted2/23ms2652 KiB
7Accepted2/23ms2796 KiB
8Accepted2/23ms2724 KiB
9Accepted2/23ms2860 KiB
10Accepted2/23ms2932 KiB
11Accepted2/26ms3332 KiB
12Accepted2/218ms3804 KiB
13Accepted2/22ms3256 KiB
14Accepted2/232ms5564 KiB
15Accepted2/228ms5632 KiB
16Accepted2/237ms5780 KiB
17Accepted4/428ms5568 KiB
18Accepted6/628ms5568 KiB
19Accepted6/630ms5564 KiB
20Accepted6/627ms5568 KiB