Submission #33859


Source Code Expand

Copy
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
using namespace std;
#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)

typedef long long ll;
#define INF (1<<29)

int main(){
	int i, n, t, j, k;
	vector<int> v[100];
	cin >> n;
	REP(i,n){
		v[i].push_back(2000000);
		cin >> t;
		REP(j,i+1){
			int x=v[j].size();
			int y=v[j][x-1];
			if(y>=t){
				v[j].push_back(t);
				break;
			}
		}
	}
	REP(i,n){
		if(v[i].size()==1){
			cout << i << endl;
			break;
		}
		if(i==n-1)cout << i+1 << endl;
		//REP(j,v[i].size())cout << v[i][j] << " ";
		//puts("");
	}
	return 0;
}

Submission Info

Submission Time
Task C - 積み重ね
User tetsuma
Language C++ (G++ 4.6.4)
Score 100
Code Size 839 Byte
Status AC
Exec Time 23 ms
Memory 892 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 20 ms 788 KB
00_sample_01.txt AC 19 ms 792 KB
00_sample_02.txt AC 21 ms 764 KB
00_sample_03.txt AC 23 ms 780 KB
00_sample_04.txt AC 22 ms 756 KB
00_sample_05.txt AC 21 ms 784 KB
01_rnd_00.txt AC 21 ms 788 KB
01_rnd_01.txt AC 22 ms 808 KB
01_rnd_02.txt AC 21 ms 796 KB
01_rnd_03.txt AC 21 ms 788 KB
01_rnd_04.txt AC 21 ms 740 KB
01_rnd_05.txt AC 21 ms 800 KB
01_rnd_06.txt AC 21 ms 792 KB
01_rnd_07.txt AC 22 ms 792 KB
01_rnd_08.txt AC 20 ms 760 KB
01_rnd_09.txt AC 22 ms 792 KB
02_maxrnd_00.txt AC 20 ms 808 KB
02_maxrnd_01.txt AC 21 ms 792 KB
02_maxrnd_02.txt AC 21 ms 788 KB
02_maxrnd_03.txt AC 20 ms 788 KB
02_maxrnd_04.txt AC 21 ms 792 KB
02_maxrnd_05.txt AC 21 ms 792 KB
02_maxrnd_06.txt AC 21 ms 780 KB
02_maxrnd_07.txt AC 22 ms 796 KB
02_maxrnd_08.txt AC 21 ms 796 KB
02_maxrnd_09.txt AC 21 ms 816 KB
02_maxrnd_10.txt AC 20 ms 792 KB
02_maxrnd_11.txt AC 20 ms 792 KB
02_maxrnd_12.txt AC 20 ms 788 KB
02_maxrnd_13.txt AC 21 ms 784 KB
02_maxrnd_14.txt AC 22 ms 792 KB
02_maxrnd_15.txt AC 22 ms 796 KB
02_maxrnd_16.txt AC 20 ms 788 KB
02_maxrnd_17.txt AC 20 ms 808 KB
02_maxrnd_18.txt AC 20 ms 792 KB
02_maxrnd_19.txt AC 21 ms 792 KB
03_increase_00.txt AC 20 ms 792 KB
03_increase_01.txt AC 21 ms 892 KB
03_increase_02.txt AC 21 ms 788 KB
04_decrease_00.txt AC 21 ms 784 KB
04_decrease_01.txt AC 21 ms 792 KB
04_decrease_02.txt AC 21 ms 792 KB
05_same_00.txt AC 20 ms 792 KB
05_same_01.txt AC 20 ms 768 KB