| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 27991 | 23级.刘展翔 | 【S】T2 区间 | C++ | Time Limit Exceeded | 30 | 1000 MS | 4136 KB | 581 | 2024-03-31 18:51:57 |
#include <iostream> #include <cmath> using namespace std; const int MAXN = 1e6 + 15; int n, x; int a[MAXN]; int main() { cin >> n >> x; for (int i = 1; i <= n; i++) { cin >> a[i]; } int ans = 0; for (int l = 1; l <= n; l++) { int Max = a[l], Min = a[l]; for (int i = l; i <= n; i++) { Max = max(Max, a[i]); Min = min(Min, a[i]); if (Max + Min == x) { ans++; } } } cout << ans << endl; return 0; }