1041 Be Unique (20 分)
用个map处理一下即可,反复出现就记录错误,只出现一次就记录正确
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
unordered_map<int, bool> unq;
int seq[N];
int main() {
int n;
scanf("%d",&n);
for(int i = 0; i < n; i++) {
scanf("%d",seq+i);
if(unq.count(seq[i]) == 0) unq[seq[i]] = 1;//第一次出现
else unq[seq[i]] = 0;
}
for(int i = 0; i < n; i++) {
int now = seq[i];
if(unq[now]) {
printf("%d",now);
return 0;
}
}
printf("None");
return 0;
}
1043 Is It a Binary Search Tree (25 分)
核心思想和前中序建树很类似,对镜像与否进行简单判断并标记状态以后直接进入递归即可
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int f = -1, book;//默认为镜像,1为镜像
struct node{
int val;
node *l, *r;
};
int arr[N];
vector<int> ans;
void postorder(node *root) {
if(root == NULL) return;
postorder(root->l);
postorder(root->r);
ans.push_back(root->val);
}
node* create(int l, int r) {
if(l > r || book) return NULL;
node* root = new node;
root->val = arr[l];
int i = l+1;
for(; i <= r; i++) {
int t = f * (arr[i] - arr[l]);
if(t < 0 || (t == 0 && f == -1)) break;
}
int l2 = i-1;
for(; i <= r; i++) {
int t = f * (arr[i] - arr[l]);
if(t > 0 || (t == 0 && f == 1)) book = 1;
}
root->l = create(l + 1, l2);
root->r = create(l2 + 1, r);
return root;
}
int main() {
int n;
scanf("%d",&n);
for(int i = 0; i < n; i++) scanf("%d",arr+i);
if(n > 1) {
if(arr[1] >= arr[0]) f = 1;
}
node* root = create(0, n-1);
if(book) printf("NO\n");
else {
printf("YES\n");
postorder(root);
for(int i = 0; i < ans.size(); i++) {
if(i) printf(" ");
printf("%d",ans[i]);
}
}
return 0;
}
1044 Shopping in Mars (25 分)
用双指针一气胡写,竟然混过去了,看了别人用的滑动窗口觉得思想其实差不多,只是我为了不循环两遍又加又减有时候就会导致答案重复出现了,为了去重使用set之后时间大大上升了,不过还是挺快的
垃圾代码(109ms)
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int pre[N], mi = 1 << 30;
unordered_map<int, set<pair<int, int> > >mp;
int main() {
int n, m, t;
scanf("%d %d",&n, &m);
for(int i = 1; i <= n; i++) {
scanf("%d",&t);
pre[i] = pre[i-1] + t;
}
int i = 0, j = 1;
while(i <= n && j <= n) {
t = pre[j] - pre[i];
while(j <= n && t < m) j++, t = pre[j] - pre[i];
if(t <= mi) mi = t, mp[mi].insert(make_pair(i+1, j));
i++;
t = pre[j] - pre[i];
while(i <= n && t > m) i++, t = pre[j] - pre[i];
if(t < m) t = pre[j] - pre[--i];
if(t <= mi) mi = t, mp[mi].insert(make_pair(i+1, j));
j++;
}
i = 0;
for(auto it: mp[mi]) {
if(i++) printf("\n");
cout<<it.first<<"-"<<it.second;
}
return 0;
}
正常的二分方法(237 ms)
即以每个位置为起点查询第一个大于等于m的序列并记录,注意二分当中序列起点不能改变,改变的始终都是序列的右端点
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int pre[N], mi = 1 << 30, n, m, t;;
struct node{
int st, ed, sum;
};
vector<node> ans;
int binary(int l) {
int r = n, i = l;
while(l <= r) {
int mid = (l + r) / 2;
if(pre[mid] - pre[i-1] >= m) r = mid - 1;
else l = mid + 1;
}
return l;
}
int main() {
scanf("%d %d",&n, &m);
for(int i = 1; i <= n; i++) {
scanf("%d",&t);
pre[i] = pre[i-1] + t;
}
for(int i = 1; i <= n; i++) {
int j = binary(i);
int sum = pre[j] - pre[i-1];
if(sum >= m) {
if(!ans.size()) {
ans.push_back({i, j, sum});
}
else {
if(sum < ans[0].sum) {
ans.clear();
ans.push_back({i, j, sum});
}
else if(sum == ans[0].sum) {
ans.push_back({i, j, sum});
}
}
}
}
// int i = 0;
for(auto it: ans) {
// if(i++) printf("\n");
cout<<it.st<<"-"<<it.ed<<endl;
}
return 0;
}
1045 Favorite Color Stripe (30 分)
最长递增子序列,不过使用优先级当递增的,然后要剔除掉所有不在喜欢的颜色里的数字
#include<bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int pri[N], dp[N], arr[N];
int main() {
int n, k, t;
scanf("%d", &n);
scanf("%d", &k);
for(int i = 1; i <= k; i++) {
scanf("%d", &t);
pri[t] = i;
}
scanf("%d", &k);
int m = 0;
for(int i = 0; i < k; i++) {
scanf("%d", &t);
if(!pri[t]) continue;
if(pri[t] >= pri[dp[m]]) dp[++m] = t;
else {
int l = 1, r = m, mid;
while(l <= r) {
mid = (l+r)/2;
if(pri[dp[mid]] > pri[t]) r = mid - 1;
else l = mid + 1;
}
dp[l] = t;
}
}
printf("%d", m);
return 0;
}
1046 Shortest Distance (20 分)
用一个前缀和数组简单求一下即可
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int pre[N], a[N];
int main() {
int n, m;
scanf("%d",&n);
for(int i = 1; i <= n; i++) {
scanf("%d",a+i);
pre[i+1] = pre[i] + a[i];
}
scanf("%d",&m);
for(int i = 0; i < m; i++) {
int x, y, tem;
scanf("%d %d",&x, &y);
if(x > y) swap(x, y);
int l1 = pre[y] - pre[x];
int l2 = pre[n+1] - pre[y] + pre[x];
printf("%d\n",min(l1, l2));
}
return 0;
}
1047 Student List for Course (25 分)
没啥难的,就是一开始用map<int, set< string > >就超时了,如果set超时试试vector一般就行了,即vector< string > vec[N],而且string输入输出必须还成scanf,printf,不然也会超时。
(一个很奇怪的点,一开始我用了一个map来进行映射,虽然后来发现完全是吃饱了撑的没事干,但是不知道为啥错了)
#include<bits/stdc++.h>
using namespace std;
//map<int, int> mp;
vector<string> v[50005];
int main() {
int n, k, cnt = 0;
scanf("%d %d",&n,&k);
string a;
a.resize(5);
int b, c;
for(int i = 0; i < n; i++) {
scanf("%s %d",&a[0],&b);
for(int j = 0; j < b; j++) {
scanf("%d",&c);
v[c].push_back(a);
}
}
for(int i = 1; i<= k; i++) {
sort(v[i].begin(), v[i].end());
printf("%d %d\n",i, v[i].size());
for(int j = 0; j < v[i].size(); j++) {
printf("%s\n",v[i][j].c_str());
}
}
return 0;
}
1050 String Subtraction (20 分)
注意点:给定的第二个字符串可能是包含空格的,所以必须用getline读取
#include<bits/stdc++.h>
using namespace std;
bool del[500];
int main() {
string a, b;
getline(cin, a);
getline(cin, b);
int l1 = a.length(), l2 = b.length();
for(int i = 0; i < l2; i++) {
del[b[i]] = 1;
}
for(int i = 0; i < l1; i++) {
if(del[a[i]]) continue;
printf("%c",a[i]);
}
return 0;
}