Submission #6462330


Source Code Expand

Copy
#include<iostream>
#include<list>
#include<vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<math.h>
#include<unordered_map>
#include<map>

using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using lst = list<ll>;


int main()
{
	int N;
	cin >> N;

	map<int, int> mp;

	for (int i = 0; i < N; ++i)
	{
		int A; cin >> A;
		mp[A]++;

		auto itr = mp.find(A);
		if (itr != mp.begin())
		{
			--itr;
			itr->second--;
			if (itr->second == 0)
			{
				//cout << "*" <<endl;
				int B = itr->first;
				mp.erase(B);
			}
		}
	}

	int ans = 0;
	for(auto & itr : mp)
	{
		ans += itr.second;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task E - Sequence Decomposing
User mori08
Language C++14 (GCC 5.4.1)
Score 500
Code Size 733 Byte
Status AC
Exec Time 81 ms
Memory 4864 KB

Judge Result

Set Name All Sample
Score / Max Score 500 / 500 0 / 0
Status
AC × 35
AC × 2
Set Name Test Cases
All all_same, killer_01, killer_02, killer_03, killer_04, killer_05, many_dup_01, many_dup_02, many_dup_03, many_dup_04, many_dup_05, many_dup_06, many_dup_07, many_dup_08, many_dup_09, many_dup_10, many_dup_11, many_dup_12, rand_max_01, rand_max_02, rand_max_03, rand_max_04, rand_max_05, rand_max_06, rand_max_07, rand_max_08, rand_max_09, rand_max_10, rand_max_11, sample_01, sample_02, sorted_ascending, sorted_descending, unique_perm_01, unique_perm_02
Sample sample_01, sample_02
Case Name Status Exec Time Memory
all_same AC 50 ms 256 KB
killer_01 AC 80 ms 4864 KB
killer_02 AC 76 ms 4608 KB
killer_03 AC 81 ms 4864 KB
killer_04 AC 63 ms 3328 KB
killer_05 AC 68 ms 3456 KB
many_dup_01 AC 53 ms 256 KB
many_dup_02 AC 51 ms 256 KB
many_dup_03 AC 52 ms 256 KB
many_dup_04 AC 45 ms 256 KB
many_dup_05 AC 44 ms 256 KB
many_dup_06 AC 41 ms 256 KB
many_dup_07 AC 42 ms 256 KB
many_dup_08 AC 41 ms 256 KB
many_dup_09 AC 38 ms 256 KB
many_dup_10 AC 42 ms 256 KB
many_dup_11 AC 42 ms 256 KB
many_dup_12 AC 39 ms 256 KB
rand_max_01 AC 58 ms 256 KB
rand_max_02 AC 57 ms 256 KB
rand_max_03 AC 55 ms 256 KB
rand_max_04 AC 57 ms 256 KB
rand_max_05 AC 55 ms 256 KB
rand_max_06 AC 56 ms 256 KB
rand_max_07 AC 62 ms 256 KB
rand_max_08 AC 58 ms 256 KB
rand_max_09 AC 55 ms 256 KB
rand_max_10 AC 60 ms 256 KB
rand_max_11 AC 55 ms 256 KB
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sorted_ascending AC 35 ms 256 KB
sorted_descending AC 66 ms 4736 KB
unique_perm_01 AC 46 ms 256 KB
unique_perm_02 AC 46 ms 256 KB