Submission #33947


Source Code Expand

Copy
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
using namespace std;
const double PI = 3.14159265358979323846;

int N,w[50],ans=0;
vector<int> M;
int main(){
	cin>>N;
	for(int i = 0; i < N; i++)cin>>w[i];
	M.push_back(w[0]);
	ans++;
	for(int i = 1; i < N; i++){
		sort(M.begin(),M.end());
		for(int j = 0; j <= ans; j++){
			if(j==ans){
				M.push_back(w[i]);
				ans++;
			}
			if(w[i]<=M[j]){
				M[j]=w[i];
				break;
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

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