Submission #34048


Source Code Expand

Copy
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <set>

#define rep2(i, b, n) for(int i=b; i < n; ++i)
#define rep(i, n) rep2(i, 0, n)
#define sz(v) v.size()
#define mk(x, y) make_pair(x, y)
#define fst first
#define scd second
#define MEMSET(x, n) memset(x, n, sizeof(x))
#define MEMZERO(x) MEMSET(x, 0)
#define URU(y) (!(y % 4) && y % 100 || !(y % 400))

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

int main( void ) 
{
	int n, m[50];
	while(cin >> n) {
		fill(m, m+50, -1);
		int size = 1;
		cin >> m[0];
		rep(i, n-1) {
			bool hit = false;
			int w;
			cin >> w;
			rep(j, size) {
				if(m[j] >= w) {
					m[j] = w;
					hit = true;
					break;
				}
			}
			if(!hit) {
				m[size++] = w;
			}
		}
		cout << size << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task C - 積み重ね
User kkk
Language C++ (G++ 4.6.4)
Score 100
Code Size 893 Byte
Status AC
Exec Time 22 ms
Memory 820 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 44
Set Name Test Cases
All 00_min.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 02_maxrnd_00.txt, 02_maxrnd_01.txt, 02_maxrnd_02.txt, 02_maxrnd_03.txt, 02_maxrnd_04.txt, 02_maxrnd_05.txt, 02_maxrnd_06.txt, 02_maxrnd_07.txt, 02_maxrnd_08.txt, 02_maxrnd_09.txt, 02_maxrnd_10.txt, 02_maxrnd_11.txt, 02_maxrnd_12.txt, 02_maxrnd_13.txt, 02_maxrnd_14.txt, 02_maxrnd_15.txt, 02_maxrnd_16.txt, 02_maxrnd_17.txt, 02_maxrnd_18.txt, 02_maxrnd_19.txt, 03_increase_00.txt, 03_increase_01.txt, 03_increase_02.txt, 04_decrease_00.txt, 04_decrease_01.txt, 04_decrease_02.txt, 05_same_00.txt, 05_same_01.txt
Case Name Status Exec Time Memory
00_min.txt AC 21 ms 808 KB
00_sample_01.txt AC 20 ms 780 KB
00_sample_02.txt AC 21 ms 792 KB
00_sample_03.txt AC 21 ms 792 KB
00_sample_04.txt AC 20 ms 784 KB
00_sample_05.txt AC 21 ms 792 KB
01_rnd_00.txt AC 21 ms 784 KB
01_rnd_01.txt AC 21 ms 768 KB
01_rnd_02.txt AC 22 ms 820 KB
01_rnd_03.txt AC 21 ms 788 KB
01_rnd_04.txt AC 20 ms 784 KB
01_rnd_05.txt AC 21 ms 788 KB
01_rnd_06.txt AC 21 ms 764 KB
01_rnd_07.txt AC 20 ms 760 KB
01_rnd_08.txt AC 20 ms 780 KB
01_rnd_09.txt AC 20 ms 788 KB
02_maxrnd_00.txt AC 21 ms 788 KB
02_maxrnd_01.txt AC 21 ms 796 KB
02_maxrnd_02.txt AC 21 ms 768 KB
02_maxrnd_03.txt AC 21 ms 796 KB
02_maxrnd_04.txt AC 21 ms 792 KB
02_maxrnd_05.txt AC 21 ms 764 KB
02_maxrnd_06.txt AC 21 ms 788 KB
02_maxrnd_07.txt AC 20 ms 784 KB
02_maxrnd_08.txt AC 21 ms 780 KB
02_maxrnd_09.txt AC 21 ms 792 KB
02_maxrnd_10.txt AC 21 ms 816 KB
02_maxrnd_11.txt AC 21 ms 796 KB
02_maxrnd_12.txt AC 20 ms 792 KB
02_maxrnd_13.txt AC 20 ms 792 KB
02_maxrnd_14.txt AC 20 ms 788 KB
02_maxrnd_15.txt AC 19 ms 784 KB
02_maxrnd_16.txt AC 21 ms 780 KB
02_maxrnd_17.txt AC 21 ms 796 KB
02_maxrnd_18.txt AC 22 ms 796 KB
02_maxrnd_19.txt AC 22 ms 812 KB
03_increase_00.txt AC 21 ms 792 KB
03_increase_01.txt AC 21 ms 764 KB
03_increase_02.txt AC 22 ms 780 KB
04_decrease_00.txt AC 20 ms 788 KB
04_decrease_01.txt AC 20 ms 788 KB
04_decrease_02.txt AC 21 ms 784 KB
05_same_00.txt AC 20 ms 748 KB
05_same_01.txt AC 21 ms 760 KB