Submission #1221349
Source Code Expand
#include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<queue> #include<stack> #include<set> #include<map> #include<cstdlib> #include<ctime> #include<climits> #define rep(i,a,b) for(int i=(a);i<=(b);i++) #define per(i,a,b) for(int i=(a);i>=(b);i--) #define inf 0x3f3f3f3f #define N 100010 #define M using namespace std; inline int read(){ int x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();} return x*f; } int n,a[N],f[N][2]; int main(){ n=read(); rep(i,1,n) a[i]=read(); f[1][0]=1;f[1][1]=1; rep(i,2,n){ f[i][0]=f[i][1]=inf; if(a[i]>=a[i-1]){ f[i][0]=min(f[i][0],f[i-1][0]); f[i][1]=min(f[i][1],min(f[i-1][0],f[i-1][1])+1); } if(a[i]<=a[i-1]){ f[i][0]=min(f[i][0],min(f[i-1][0],f[i-1][1])+1); f[i][1]=min(f[i][1],f[i-1][1]); } } printf("%d\n",min(f[n][0],f[n][1])); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | st_nec |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1010 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 1280 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 128 KB |
sample_02.txt | AC | 1 ms | 128 KB |
sample_03.txt | AC | 0 ms | 128 KB |
subtask_1_01.txt | AC | 6 ms | 896 KB |
subtask_1_02.txt | AC | 4 ms | 768 KB |
subtask_1_03.txt | AC | 3 ms | 512 KB |
subtask_1_04.txt | AC | 9 ms | 1280 KB |
subtask_1_05.txt | AC | 9 ms | 1280 KB |
subtask_1_06.txt | AC | 9 ms | 1280 KB |
subtask_1_07.txt | AC | 9 ms | 1280 KB |
subtask_1_08.txt | AC | 9 ms | 1280 KB |
subtask_1_09.txt | AC | 9 ms | 1280 KB |
subtask_1_10.txt | AC | 1 ms | 128 KB |
subtask_1_11.txt | AC | 0 ms | 128 KB |