A
注意是数组中最小那个数的最近相邻距离
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 1e5 + 10;
const int INF = 1e9 + 10;
map<int, int> mp;
int num[qq];
int main(){
int n; scanf("%d", &n);
int minx = INF;
int flag = INF;
for (int i = 0; i < n; ++i) {
scanf("%d", num + i);
flag = min(flag, num[i]);
}
for (int i = 0; i < n; ++i) {
if (mp.find(num[i]) == mp.end()) {
mp[num[i]] = i;
} else {
if (num[i] == flag) {
minx = min(minx, i - mp[num[i]]);
}
mp[num[i]] = i;
}
}
printf("%d\n", minx);
return 0;
}
B
枚举a类型蛋糕占了几盘
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 1e5 + 10;
const int INF = 1e9 + 10;
int main(){
int n, a, b; scanf("%d%d%d", &n, &a, &b);
int maxn = 0;
for (int i = 1; i < n; ++i) {
int ta = a / i, tb = b / (n - i);
maxn = max(maxn, min(ta, tb));
}
printf("%d\n", maxn);
return 0;
}
C
题意:给出k1, k2, k3,你可以任选x1,x2,x3,对于xi + ki,xi + 2*ki。。。的时间灯泡会亮,问是否可以从max(x1, x2, x3)开始每一个整数点时间都存在至少一个灯泡是亮的
思路:很明显如果k1,k2,k3中存在一个1,那么很显然成立,至少存在两个2也成立,三个3也成立,关键在一个2和两个4,这个要考虑到
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 1e5 + 10;
const int INF = 1e9 + 10;
int k[qq];
int main(){
bool f = false;
int cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0;
for (int i = 0; i < 3; ++i) {
scanf("%d", k + i);
if (k[i] == 1) cnt1++;
if (k[i] == 2) cnt2++;
if (k[i] == 3) cnt3++;
if (k[i] == 4) cnt4++;
}
if (cnt1 > 0 || cnt2 > 1 || cnt3 > 2 || (cnt2 == 1 && cnt4 == 2)) {
puts("YES");
} else {
puts("NO");
}
return 0;
}
D
题意:给出n个数,然后有m次询问,每次询问给出l r,代表翻转区间l r的数,然后你要输出翻转n个数组成逆序数对的奇偶性
思路:逆序数对的改变只针对区间l r,所以我们只需要考虑这段区间逆序数对的改变即可,观察可以发现,当一个区间翻转后,原来的逆序数对变成了非逆序数对,非逆序数对变成了逆序数对
假设 未翻转前逆序数对有x,非逆序数对有y
则 翻转后 逆序数对有y,非逆序数对有x, 如果x + y 是偶数,则奇偶性不变,如果x + y是奇数,则奇偶性改变
所以我们只需要看 区间l r的长度即可
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 1e5 + 10;
const int INF = 1e9 + 10;
int num[1505], sum[1505];
int n;
void upDate(int x) {
while (x < 1505) {
sum[x] += 1;
x += (x & (-x));
}
}
int get(int x) {
int ans = 0;
while (x > 0) {
ans += sum[x];
x -= (x & (-x));
}
return ans;
}
int main(){
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", num + i);
}
int f = 0;
for (int i = n; i >= 1; --i) {
f += get(num[i]);
upDate(num[i]);
}
f %= 2;
int m; scanf("%d", &m);
int l, r;
while (m--) {
scanf("%d%d", &l, &r);
if (l == r) {
printf("%s\n", f == 1 ? "odd" : "even");
} else {
int k = (r - l + 1);
int tmp = k * (k - 1) / 2;
if (tmp % 2 == 1) f ^= 1;
printf("%s\n", f == 1 ? "odd" : "even");
}
}
return 0;
}
E
思路:这题思路还是很好出来的,就是每次将比栈顶的元素小且存在的元素从大到小压入栈内,然后依次出栈,还是有些细节要考虑,比如栈空等情况
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 3e5 + 10;
const int INF = 1e9 + 10;
stack<int> st;
int n, k;
int num[qq], vis[qq];
vector<int> g[qq];
int main(){
scanf("%d%d", &n, &k);
int now = 1;
for (int i = 1; i <= k; ++i) {
scanf("%d", num + i);
if (num[i] == now) {
now++;
vis[num[i]] = 2;
while (!st.empty() && st.top() == now) {
now++;
vis[st.top()] = 2;
st.pop();
}
} else {
st.push(num[i]);
vis[num[i]] = 1;
}
}
int cur = 1;
bool f = true;
int p = 0;
while (!st.empty()) {
int u = st.top();
st.pop();
while (cur < u) {
if (vis[cur] == 1) f = false;
if (vis[cur] != 2) {
vis[cur] = 2;
g[p].pb(cur);
}
cur++;
}
if (!f) break;
p++;
vis[u] = 2;
cur = u + 1;
}
while (cur < n + 1) {
if (vis[cur] == 0) g[p].pb(cur);
cur++;
}
p++;
if (!f) {
printf("-1\n");
} else {
for (int i = 1; i <= k; ++i) {
printf("%d ", num[i]);
}
for (int i = 0; i < p; ++i) {
for (int j = g[i].size() - 1; j >= 0; --j) {
printf("%d ", g[i][j]);
}
}
}
return 0;
}