Submission #1493337


Source Code Expand

#include <iostream>
using namespace std;
int n,a[100005],ans=1,dir,st;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n;
	st=n+1;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(st==n+1 && i>1 && a[i]!=a[i-1])st=i;
	}
	dir=(a[st-1]<a[st]);
	for(int i=st+1;i<=n;i++){
		if(a[i-1]==a[i])continue;
		if((a[i-1]<a[i])!=dir){
			ans++;
			while(i<n){
				if(a[i]!=a[i+1]){
					dir=(a[i]<a[i+1]);
					break;
				}
				i++;
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task A - Sorted Arrays
User fts2001
Language C++14 (GCC 5.4.1)
Score 300
Code Size 497 Byte
Status AC
Exec Time 11 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 17
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt AC 7 ms 512 KB
subtask_1_02.txt AC 6 ms 512 KB
subtask_1_03.txt AC 4 ms 384 KB
subtask_1_04.txt AC 11 ms 640 KB
subtask_1_05.txt AC 11 ms 640 KB
subtask_1_06.txt AC 11 ms 640 KB
subtask_1_07.txt AC 11 ms 640 KB
subtask_1_08.txt AC 11 ms 640 KB
subtask_1_09.txt AC 11 ms 640 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB