CF940D Alena And The Heater

思路：

模拟。

实现：

 #include <bits/stdc++.h>
 using namespace std;
 const int INF = 1e9;
 int a[], n;
 string b;
 int main()
 {
     while (cin >> n)
     {
         for (int i = ; i < n; i++) cin >> a[i];
         cin >> b;
         int l = -INF, r = INF;
         for (int i = ; i < n; i++)
         {
             if (b[i] != b[i - ])
             {
                 if (b[i] == '' && b[i - ] == '' && b[i - ] == '' && b[i - ] == '' && b[i - ] == '')
                 {
                     int tmp = INF; for (int j = i - ; j <= i; j++) tmp = min(tmp, a[j]);
                     if (r >= tmp) r = tmp - ;
                 }
                 else if (b[i] == '' && b[i - ] == '' && b[i - ] == '' && b[i - ] == '' && b[i - ] == '')
                 {
                     int tmp = -INF; for (int j = i - ; j <= i; j++) tmp = max(tmp, a[j]);
                     if (l <= tmp) l = tmp + ;
                 }
             }
         }
         cout << l << " " << r << endl;
     }
     return ;
 }