Submission #6797830

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);

int main()
{
	int n, h, m = 0;
	cin >> n;

	bool res = true;
	for(int i = 0; i < n; i++) {
		cin >> h;
		if(m - h >= 2) {
			res = false;
			break;
		}
		m = max(m, h);
	}

	if(res == true) {
		cout << "Yes" << endl;
	} else {
		cout << "No" << endl;
	}

	return 0;
}

Submission Info

Submission Time
Task C - Build Stairs
User ameolp
Language C++14 (GCC 5.4.1)
Score 300
Code Size 809 Byte
Status AC
Exec Time 57 ms
Memory 256 KiB

Judge Result

Set Name All Sample
Score / Max Score 300 / 300 0 / 0
Status
AC × 17
AC × 4
Set Name Test Cases
All sample_01, sample_02, sample_03, sample_04, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13
Sample sample_01, sample_02, sample_03, sample_04
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KiB
sample_02 AC 1 ms 256 KiB
sample_03 AC 1 ms 256 KiB
sample_04 AC 1 ms 256 KiB
testcase_01 AC 1 ms 256 KiB
testcase_02 AC 1 ms 256 KiB
testcase_03 AC 51 ms 256 KiB
testcase_04 AC 55 ms 256 KiB
testcase_05 AC 12 ms 256 KiB
testcase_06 AC 18 ms 256 KiB
testcase_07 AC 34 ms 256 KiB
testcase_08 AC 36 ms 256 KiB
testcase_09 AC 1 ms 256 KiB
testcase_10 AC 1 ms 256 KiB
testcase_11 AC 54 ms 256 KiB
testcase_12 AC 1 ms 256 KiB
testcase_13 AC 57 ms 256 KiB