1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
const int maxn = 1e3 + 17;
9
int T, n, a[maxn], d;
10

11
int main() {
12
  cin >> T;
13
  while(T--) {
14
    cin >> n >> d;
15
    int flg = 0;
16
    for(int i = 1; i <= n; i++) {
17
      cin >> a[i];
18
      if(a[i] > d) flg = 1;
19
    }
20
    if(flg) {
21
      sort(a + 1, a + 1 + n);
22
      if(a[1] + a[2] <= d) flg = 0;
23
    }
24
    puts(flg ? "NO" : "YES");
25
  }
26
  return 0;
27
}

1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
int T;
9

10
inline int gcd(int x, int y) {
11
  return y ? gcd(y, x % y) : x;
12
}
13

14
int main() {
15
  cin >> T;
16
  while(T--) {
17
    string s1, s2;
18
    cin >> s1; cin >> s2;
19
    int len1 = s1.length(), len2 = s2.length();
20
    int l1 = 0, l2 = 0;
21
    for(l1 = 1; l1 <= len1; l1++) {
22
      int flg = 1;
23
      for(int i = l1; i < len1;) {
24
        for(int j = 0; j < l1; j++, i++) {
25
          if(s1[i] != s1[j]) flg = 0;
26
        }
27
      }
28
      if(flg) break;
29
    }
30
    for(l2 = 1; l2 <= len2; l2++) {
31
      int flg = 1;
32
      for(int i = l2; i < len2;) {
33
        for(int j = 0; j < l2; j++, i++) {
34
          if(s2[i] != s2[j]) flg = 0;
35
        }
36
      }
37
      if(flg) break;
38
    }
39
    if(l1 == l2) {
40
      int flg = 1;
41
      for(int i = 0; i < l1; i++) {
42
        if(s1[i] != s2[i]) flg = 0;
43
      }
44
      if(flg) {
45
        int x = len1 / l1, y = len2 / l2;
46
        int rep = x * y / gcd(x, y);
47
        for(int i = 1; i <= rep; i++) {
48
          for(int j = 0; j < l1; j++) printf("%c", s1[j]);
49
        }
50
        printf("\n");
51
      }
52
      else {
53
        puts("-1");
54
      }
55

56
    }
57
    else puts("-1");
58
  }
59
  return 0;
60
}

1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
int T, n, k;
9

10
int main() {
11
  cin >> T;
12
  while(T--) {
13
    cin >> n >> k;
14
    for(int i = 1; i < 2 * k - n; i++) printf("%d%c", i, " \n"[i == k]);
15
    int j = k;
16
    for(int i = 2 * k - n; i <= k; i++, j--) printf("%d%c", j, " \n"[i == k]);
17
  }
18
  return 0;
19
}

1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
const int maxn = 2e5 + 17;;
9
int T, n, m, a[maxn], s[maxn], dmax[maxn][20], dmin[maxn][20];
10
void initMax(int n,int d[])
11
{
12
    for(int i=1;i<=n;i++)dmax[i][0]=d[i];
13
    for(int j=1;(1<<j)<=n;j++)
14
        for(int i=1;i+(1<<j)-1<=n;i++)
15
            dmax[i][j]=max(dmax[i][j-1],dmax[i+(1<<(j-1))][j-1]);
16
}
17
int getMax(int L,int R)
18
{
19
    int k=0;
20
    while((1<<(k+1))<=R-L+1)k++;
21
    return max( dmax[L][k],dmax[R-(1<<k)+1][k] );
22
}
23
void initMin(int n,int d[])
24
{
25
    for(int i=1;i<=n;i++)dmin[i][0]=d[i];
26
    for(int j=1;(1<<j)<=n;j++)
27
        for(int i=1;i+(1<<j)-1<=n;i++)
28
            dmin[i][j]=min( dmin[i][j-1],dmin[i+(1<<(j-1))][j-1] );
29
}
30
int getMin(int L,int R)
31
{
32
    int k=0;
33
    while((1<<(k+1))<=R-L+1)k++;
34
    return min( dmin[L][k],dmin[R-(1<<k)+1][k] );
35
}
36

37
int main() {
38
  scanf("%d", &T);
39
  while(T--) {
40
    scanf("%d%d", &n, &m);
41
    string str;
42
    cin >> str;
43
    for(int i = 1; i <= n; i++) a[i] = (str[i - 1] == '+' ? 1 : -1);
44
    for(int i = 1; i <= n; i++) s[i] = s[i - 1] + a[i];
45
    initMin(n, s);
46
    initMax(n, s);
47
    for(int i = 1; i <= m; i++) {
48
      int l, r;
49
      scanf("%d%d", &l, &r);
50
      int tmp = s[r] - s[l - 1];
51
      int mx = 0, mn = 0;
52
      if(l > 1) {
53
        mx = max(mx, getMax(1, l - 1));
54
        mn = min(mn, getMin(1, l - 1));
55
      }
56
      if(r < n) {
57
        mx = max(mx, getMax(r + 1, n) - tmp);
58
        mn = min(mn, getMin(r + 1, n) - tmp);
59
      }
60
      printf("%d\n", mx - mn + 1);
61
    }
62
  }
63
  return 0;
64
}