Submission #1241714
Source Code Expand
// Copyright (C) 2017 __debug. // This program is free software; you can redistribute it and/or // modify it under the terms of the GNU General Public License as // published by the Free Software Foundation; version 3 // This program is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // You should have received a copy of the GNU General Public License // along with this program; If not, see <http://www.gnu.org/licenses/>. #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/priority_queue.hpp> #define x first #define y second #define MP std::make_pair #define SZ(x) ((int)(x).size()) #define ALL(x) (x).begin(), (x).end() #define DEBUG(...) fprintf(stderr, __VA_ARGS__) #ifdef __linux__ #define getchar getchar_unlocked #define putchar putchar_unlocked #endif using std::pair; using std::vector; using std::string; typedef long long LL; typedef pair<int, int> Pii; const int oo = 0x3f3f3f3f; template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; } template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; } string procStatus() { std::ifstream t("/proc/self/status"); return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>()); } template<typename T> T read(T &x) { int f = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) f = (ch == '-' ? -1 : 1); for (x = 0; isdigit(ch); ch = getchar()) x = 10 * x + ch - '0'; return x *= f; } template<typename T> void write(T x) { if (x == 0) { putchar('0'); return; } if (x < 0) { putchar('-'); x = -x; } static char s[20]; int top = 0; for (; x; x /= 10) s[++top] = x % 10 + '0'; while (top) putchar(s[top--]); } // EOT const int MAXN = 1e5 + 5; int N, A[MAXN]; void input() { read(N); for (int i = 1; i <= N; ++i) { read(A[i]); } } void solve() { static int dp[MAXN][2]; dp[1][0] = dp[1][1] = 1; for (int i = 2; i <= N; ++i) { dp[i][0] = dp[i][1] = std::min(dp[i - 1][0], dp[i - 1][1]) + 1; if (A[i] >= A[i - 1]) chkmin(dp[i][0], dp[i - 1][0]); if (A[i] <= A[i - 1]) chkmin(dp[i][1], dp[i - 1][1]); } int ans = std::min(dp[N][0], dp[N][1]); printf("%d\n", ans); } int main() { #ifdef __DEBUG freopen("A.in", "r", stdin); freopen("A.out", "w", stdout); #endif input(); solve(); return 0; } // 弱冠弄柔翰,卓荦观群书。 // -- 左思《咏史八首·其一》
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | debug18 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 2882 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 1408 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 | 3 ms | 1024 KB |
subtask_1_02.txt | AC | 3 ms | 768 KB |
subtask_1_03.txt | AC | 2 ms | 640 KB |
subtask_1_04.txt | AC | 5 ms | 1408 KB |
subtask_1_05.txt | AC | 5 ms | 1408 KB |
subtask_1_06.txt | AC | 5 ms | 1408 KB |
subtask_1_07.txt | AC | 5 ms | 1408 KB |
subtask_1_08.txt | AC | 5 ms | 1408 KB |
subtask_1_09.txt | AC | 5 ms | 1408 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |