京东2017实习生招聘在线笔试编程题题解

#include <bits/stdc++.h>
#define maxn 100009
using namespace std;
int n;
char s[maxn];
bool vis[maxn];
int main(){
scanf("%d", &n);
scanf("%s", s);
memset(vis, 0, sizeof(vis));
for(int i = 0; i < n; i++){
if(s[i] == 'X' || s[i] == '#')
continue;
int x = s[i] - '0';
for(int j = 0; j <= x; j++){
if(i - j >= 0)
vis[i - j] = 1;
if(i + j < n)
vis[i + j] = 1;
}
}
int ans = 0;
for(int i = 0; i < n; i++){
if(s[i] == 'X' && vis[i])
ans++;
}
printf("%d\n", ans);
return 0;
}

#include<cstdio>
#include<cstring>
int a[205],b[205],c[205];
bool q(int w,int e){
return a[e]<=a[w]&&b[e]>=a[w];
}
int n;
int s(int w,int e){
int re=0;
for(int i=1;i<=n;i++)
if(q(w,i)||q(e,i))re++;
return re;
}
void work(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
int l;
scanf("%d %d",&a[i],&l);
b[i]=a[i]+l;
}
int ans=0;
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++){
int k=s(i,j);
if(k>ans)ans=k;
}
printf("%d\n",ans);
}
int main(){
work();
return 0;
}