Cod sursa(job #3276935)
Utilizator | Data | 15 februarie 2025 10:21:45 | |
---|---|---|---|
Problema | Numarare | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | vs11_12_vine_oji_2025 | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("numarare.in");
ofstream fout("numarare.out");
/**
*/
int n, a[100002];
int main()
{
int i, st, dr, sum, ans = 0;
fin >> n;
for (i = 1; i <= n; i++)
fin >> a[i];
for (i = 1; i < n; i++)
{
st = i; dr = i + 1;
sum = a[i] + a[i + 1];
while (st > 0 && dr <= n && a[st] + a[dr] == sum)
{
st--; dr++;
}
st++; dr--;
ans += (dr - st + 1) / 2;
}
fout << ans;
return 0;
}