Submission #1220994
Source Code Expand
// eddy1021
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef double D;
typedef long double LD;
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
#define mod9 1000000009LL
#define mod7 1000000007LL
#define INF 1023456789LL
#define INF16 10000000000000000LL
#define eps 1e-9
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(), (x).end()
#ifndef ONLINE_JUDGE
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...)
#endif
inline LL getint(){
LL _x=0,_tmp=1; char _tc=getchar();
while( (_tc<'0'||_tc>'9')&&_tc!='-' ) _tc=getchar();
if( _tc == '-' ) _tc=getchar() , _tmp = -1;
while(_tc>='0'&&_tc<='9') _x*=10,_x+=(_tc-'0'),_tc=getchar();
return _x*_tmp;
}
inline LL add( LL _x , LL _y , LL _mod = mod7 ){
_x += _y;
return _x >= _mod ? _x - _mod : _x;
}
inline LL sub( LL _x , LL _y , LL _mod = mod7 ){
_x -= _y;
return _x < 0 ? _x + _mod : _x;
}
inline LL mul( LL _x , LL _y , LL _mod = mod7 ){
_x *= _y;
return _x >= _mod ? _x % _mod : _x;
}
LL mypow( LL _a , LL _x , LL _mod ){
if( _x == 0 ) return 1LL;
LL _ret = mypow( mul( _a , _a , _mod ) , _x >> 1 , _mod );
if( _x & 1 ) _ret = mul( _ret , _a , _mod );
return _ret;
}
LL mymul( LL _a , LL _x , LL _mod ){
if( _x == 0 ) return 0LL;
LL _ret = mymul( add( _a , _a , _mod ) , _x >> 1 , _mod );
if( _x & 1 ) _ret = add( _ret , _a , _mod );
return _ret;
}
inline bool equal( D _x , D _y ){
return _x > _y - eps && _x < _y + eps;
}
#define Bye exit(0)
int __ = 1 , _cs;
/*********default*********/
void build(){
}
#define N 101010
int n , a[ N ];
void init(){
n = getint();
for( int i = 0 ; i < n ; i ++ )
a[ i ] = getint();
}
void solve(){
int ans = 0;
for( int i = 0 ; i < n ; ){
int j = i + 1;
bool de = false , in = false;
ans ++;
while( j < n ){
if( a[ j ] > a[ j - 1 ] ){
if( de ) break;
in = true;
}else if( a[ j ] < a[ j - 1 ] ){
if( in ) break;
de = true;
}
j ++;
}
i = j;
}
printf( "%d\n" , ans );
}
int main(){
build();
//__ = getint();
while( __ -- ){
init();
solve();
}
}
Submission Info
Submission Time |
|
Task |
A - Sorted Arrays |
User |
eddy1021 |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
2259 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 |