# BZOJ 1303 中位数图 模拟

https://www.lydsy.com/JudgeOnline/problem.php?id=1303

 1 #include<bits/stdc++.h>
2 #define IOS ios::sync_with_stdio(false);//不可再使用scanf printf
3 #define Max(a, b) ((a) > (b) ? (a) : (b))//禁用于函数，会超时
4 #define Min(a, b) ((a) < (b) ? (a) : (b))
5 #define Mem(a) memset(a, 0, sizeof(a))
6 #define Dis(x, y, x1, y1) ((x - x1) * (x - x1) + (y - y1) * (y - y1))
7 #define MID(l, r) ((l) + ((r) - (l)) / 2)
8 #define lson ((o)<<1)
9 #define rson ((o)<<1|1)
10 #define Accepted 0
12 using namespace std;
14 {
15     int x=0,f=1;char ch=getchar();
16     while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
17     while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
18     return x*f;
19 }
20
21 typedef long long ll;
22 const int maxn = 1000000 + 10;
23 const int MOD = 1000000007;//const引用更快，宏定义也更快
24 const int INF = 1e9 + 7;
25 const double eps = 1e-6;
26 int a[maxn];
27 map<int, int>Map;
28 int main()
29 {
30      int n, t, x, start;
31      scanf("%d%d", &n, &t);
32      for(int i = 1; i <= n; i++)
33      {
34          scanf("%d", &x);
35          if(x == t)
36          {
37              start = i;
38              a[i] = 0;
39          }
40          else if(x > t)a[i] = 1;
41          else a[i] = -1;
42      }
43      for(int i = start + 1; i <= n; i++)a[i] += a[i - 1], Map[a[i]]++;
44      int ans = Map[0] + 1;
45      for(int i = start - 1; i >= 1; i--)
46      {
47          a[i] += a[i + 1];
48          ans += Map[-a[i]];
49          if(a[i] == 0)ans++;
50      }
51      cout<<ans<<endl;
52      return Accepted;
53 }

posted @ 2018-09-20 12:20  _努力努力再努力x  阅读(136)  评论(0编辑  收藏  举报