codeforces 190D Non-Secret Cypher 双指针
2016-09-07 17:39
357 查看
给定长度为n的数组a,给定k,问有多少个子数组,其中至少包含着有k个相同的数字
双指针经典题目,注意先要离散,然后注意m是1的情况
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <map>
#define rep(i, j, k) for(int i = j; i <= k; i++)
#define maxn 1000009
#define ll long long
using namespace std;
int n, m, a[maxn], c[maxn], now = 0, cnt = 0;
int cunt[maxn];
map <int, int> mp;
ll ans = 0;
int main ()
{
cin >> n >> m;
rep (i, 1, n)
cin >> a[i], c[i] = a[i];
sort (c + 1, c + 1 + n);
c[0] = c[1] - 1;
cnt = 0;
rep (i, 1, n)
if (c[i] != c[i - 1])
mp[c[i]] = ++cnt;
rep (i, 1, n)
a[i] = mp[a[i]];
//rep (i, 1, n) printf ("%d %d\n", i, a[i]);
int r = 1;
cunt[a[1]]++;
if (m == 1)
now++;
rep (l, 1, n)
{
while (now == 0 && r < n)
{
r++;
cunt[a[r]]++;
if (cunt[a[r]] >= m)
now++;
}
if (now)
ans += 1LL * n - 1LL * r + 1LL;
cunt[a[l]]--;
if (cunt[a[l]] == m - 1)
now--;
}
cout << ans << endl;
}
双指针经典题目,注意先要离散,然后注意m是1的情况
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <map>
#define rep(i, j, k) for(int i = j; i <= k; i++)
#define maxn 1000009
#define ll long long
using namespace std;
int n, m, a[maxn], c[maxn], now = 0, cnt = 0;
int cunt[maxn];
map <int, int> mp;
ll ans = 0;
int main ()
{
cin >> n >> m;
rep (i, 1, n)
cin >> a[i], c[i] = a[i];
sort (c + 1, c + 1 + n);
c[0] = c[1] - 1;
cnt = 0;
rep (i, 1, n)
if (c[i] != c[i - 1])
mp[c[i]] = ++cnt;
rep (i, 1, n)
a[i] = mp[a[i]];
//rep (i, 1, n) printf ("%d %d\n", i, a[i]);
int r = 1;
cunt[a[1]]++;
if (m == 1)
now++;
rep (l, 1, n)
{
while (now == 0 && r < n)
{
r++;
cunt[a[r]]++;
if (cunt[a[r]] >= m)
now++;
}
if (now)
ans += 1LL * n - 1LL * r + 1LL;
cunt[a[l]]--;
if (cunt[a[l]] == m - 1)
now--;
}
cout << ans << endl;
}
相关文章推荐
- Codeforces 190D Non-Secret Cypher(尺取)
- Codeforces 190D Non-Secret Cypher【思维+RMQ+二分】
- Codeforces 190D Non-Secret Cypher
- codeforces 190D Non-Secret Cypher(two pointers)
- Codeforces Round #120 (Div. 2) / 190D Non-Secret Cypher (计数&two pointers)
- Codeforces 490C Hacking Cypher【前缀模+后缀模+暴力】
- Codeforces Round #120(190D) Non-Secret Cypher(尺取法)
- 【codeforces 757D】Felicity's Big Secret Revealed
- CodeForces 190D Non-Secret Cypher
- codeforces 490-C. Hacking Cypher(暴力)
- Codeforces-808E - Selling Souvenirs(分类讨论,双指针)
- 指针的秘密(The secret of point)
- Codeforces 490C Hacking Cypher 暴力
- codeforces 372 Complete the Word(双指针)
- CodeForces 490C Hacking Cypher
- CodeForces 386C. Diverse Substrings (字符串+双指针)
- Codeforces 490C Hacking Cypher(暴力)
- 2016 GDUT Individual Contest2_A题_codeforces 416A(双指针)
- CodeForces - 620D Professor GukiZ and Two Arrays 二分 | 双指针 STL
- CodeForces 180E Cubes--后续指针--当前个数