Submission #2532299
Source Code Expand
#include<bits/stdc++.h> #define MAXN 100005 using namespace std; int read(){ char c;int x;while(c=getchar(),c<'0'||c>'9');x=c-'0'; while(c=getchar(),c>='0'&&c<='9') x=x*10+c-'0';return x; } int n,f[MAXN],ans=1,pact; int main() { n=read();pact=0; for(int i=1;i<=n;i++) f[i]=read(); for(int i=2;i<=n;i++){ if(!pact){ if(f[i]>f[i-1]) pact=1; if(f[i]<f[i-1]) pact=-1; continue; } if((f[i]<=f[i-1]&&pact<0)||(f[i]>=f[i-1]&&pact>0)) continue; ans++;pact=0; } printf("%d",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | stevensonson |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 530 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 640 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 | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 6 ms | 512 KB |
subtask_1_02.txt | AC | 5 ms | 384 KB |
subtask_1_03.txt | AC | 3 ms | 384 KB |
subtask_1_04.txt | AC | 9 ms | 640 KB |
subtask_1_05.txt | AC | 9 ms | 640 KB |
subtask_1_06.txt | AC | 9 ms | 640 KB |
subtask_1_07.txt | AC | 9 ms | 640 KB |
subtask_1_08.txt | AC | 9 ms | 640 KB |
subtask_1_09.txt | AC | 9 ms | 640 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |