結果
問題 | No.116 門松列(1) |
ユーザー |
![]() |
提出日時 | 2018-03-23 16:56:28 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 1,521 bytes |
コンパイル時間 | 1,104 ms |
コンパイル使用メモリ | 102,888 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-25 01:40:21 |
合計ジャッジ時間 | 1,934 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 |
ソースコード
# include <iostream># include <algorithm># include <vector># include <string># include <set># include <map># include <cmath># include <iomanip># include <functional># include <utility># include <stack># include <queue># include <list># include <tuple># include <unordered_map># include <numeric># include <complex># include <bitset># include <random># include <chrono>using namespace std;using LL = long long;using ULL = unsigned long long;typedef pair<LL, LL> P;constexpr int INF = 2000000000;constexpr int HINF = INF / 2;constexpr double DINF = 100000000000000000.0;constexpr long long LINF = 9223372036854775807;constexpr long long HLINF = 4500000000000000000;const double PI = acos(-1);int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };# define ALL(x) (x).begin(),(x).end()# define UNIQ(c) (c).erase(unique(ALL((c))),(c).end())# define mp make_pair# define eb emplace_back# define FOR(i,a,b) for(int i=(a);i<(b);i++)# define RFOR(i,a,b) for(int i=(a);i>=(b);i--)# define REP(i,n) FOR(i,0,n)# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0)int n;int a[101010];int main() {cin >> n;REP(i, n) {cin >> a[i];}int ans = 0;REP(i, n) {if (i >= 2) {int num = a[i] + a[i - 1] + a[i - 2];num -= max({ a[i],a[i - 1],a[i - 2] });num -= min({ a[i], a[i - 1], a[i - 2] });if (a[i] != a[i - 1] && a[i - 1] != a[i - 2] && a[i] != a[i - 2])if (num == a[i] || num == a[i - 2])ans++;}}cout << ans << endl;}