# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1252859 | nickolasarapidis | Triple Peaks (IOI25_triples) | C++20 | 0 ms | 0 KiB |
//#include "triples.h"
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
long long count_triples(vector<int> H){
int N = H.size();
long long ans = 0;
for(int i = 0; i < N; i++){
for(int j = i + 1; j < N; j++){
for(int k = j + 1; k < N; k++){
int dij = j - i, dik = k - i, djk = k - j;
multiset<int> s1, s2;
s1.insert(dij); s1.insert(dik); s1.insert(djk);
s2.insert(H[i]); s2.insert(H[j]); s2.insert(H[k]);
if(s1 == s2) ans++;
}
}
}
return ans;
}