A. Unimodal Array
题意:判断一个序列是否是先严格递增再相等再严格递减的。
思路:从两边开始枚举递增的序列,看看中间的数是否全相等就好
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<set>
#include<stack>
#include<vector>
#include<map>
#include<queue>
#define pi acos(-1)
#define maxn 111111
#define maxm 11111
#define INF 0x3F3F3F3F
#define eps 1e-8
#define pb push_back
#define mem(a) memset(a,0,sizeof a)
using namespace std ;
const long long mod = 1000000007 ;
void init() {
}
int a[1111 ];
int main() {
int n;
while (scanf ("%d" , &n) != EOF) {
for (int i = 1 ; i <= n; i++) {
scanf ("%d" , a + i);
}
int l = 1 ;
while (l < n && a[l] < a[l + 1 ]) l++;
int r = n;
while (r > 1 && a[r] < a[r - 1 ]) r--;
int fa = 1 ;
for (int i = l + 1 ; i <= r; i++) {
if (a[i] != a[l]) {
fa = 0 ;
break ;
}
}
if (fa == 1 ) printf ("YES\n" );
else printf ("NO\n" );
}
return 0 ;
}
B. Keyboard Layouts
题意:两种键盘对应关系,问一串字符再另外一个键盘中打出来是什么
思路:建个对应关系就好了
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<set>
#include<stack>
#include<vector>
#include<map>
#include<queue>
#define pi acos(-1)
#define maxn 111111
#define maxm 11111
#define INF 0x3F3F3F3F
#define eps 1e-8
#define pb push_back
#define mem(a) memset(a,0,sizeof a)
using namespace std ;
const long long mod = 1000000007 ;
void init() {
}
char s1[1111 ];
char s2[1111 ];
char ss[1111 ];
char se[1111 ];
char mp[1111 ];
int main() {
scanf ("%s" , s1);
scanf ("%s" , s2);
scanf ("%s" , ss);
for (int i = 0 ; i < 26 ; i++) {
mp[s1[i] - 'a' ] = s2[i];
}
int lenss = strlen (ss);
for (int i = 0 ; i < lenss; i++) {
if (ss[i] >= '0' && ss[i] <= '9' ) se[i] = ss[i];
if (ss[i] >= 'a' && ss[i] <= 'z' ) se[i] = mp[ss[i] - 'a' ];
if (ss[i] >= 'A' && ss[i] <= 'Z' ) se[i] = mp[ss[i] - 'A' ] + 'A' - 'a' ;
}
se[lenss] = 0 ;
printf ("%s\n" , se);
return 0 ;
}
C. Jury Marks
题意:一个人,被n个人打分,每次都给ai分,可能是负数。然后这个选手忘记了他最初是多少分,只知道中途k次评委打完分后自己的总分。k次的顺序都不知道。问他最初的分数可能有多少种。
思路:可以枚举b1是第i个评委打完分的时候的得分,然后就能算出初始的分数x,然后再去枚举判断一下用个set维护一下,最后答案存到一个set里面去重,然后输出set的大小就好了。
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<set>
#include<stack>
#include<vector>
#include<map>
#include<queue>
#define pi acos(-1)
#define maxn 111111
#define maxm 11111
#define INF 0x3F3F3F3F
#define eps 1e-8
#define pb push_back
#define mem(a) memset(a,0,sizeof a)
using namespace std ;
const long long mod = 1000000007 ;
void init() {
}
int a[2222 ];
int b[2222 ];
int sum[2222 ];
int main() {
int k, n;
memset (sum, 0 , sizeof sum);
while (scanf ("%d%d" , &k, &n) != EOF) {
for (int i = 1 ; i <= k; i++) {
scanf ("%d" , a + i);
sum[i] = sum[i - 1 ] + a[i];
}
for (int i = 1 ; i <= n; i++) {
scanf ("%d" , b + i);
}
set <int > ans;
for (int i = 1 ; i <= k; i++) {
set <int > temp;
int x = b[1 ] - sum[i];
for (int j = 1 ; j <= k; j++) {
temp.insert(x + sum[j]);
}
int fa = 1 ;
for (int j = 1 ; j <= n; j++) {
if (temp.count(b[j]) == 0 ) {
fa = 0 ;
break ;
}
}
if (fa == 1 ) {
ans.insert(x);
}
}
printf ("%d\n" , ans.size());
}
return 0 ;
}
D. Office Keys
题意:给你n个人的位置ai,不重叠,k把钥匙的位置bi,不重叠,目的地的位置p,每个人都需要去拿到一把钥匙去目的地,每把钥匙只能一个人拿,n个人同时开始,问怎么分配钥匙花的时间最少。
思路:很显然,这些被拿的钥匙肯定是连续的。所以枚举从那个钥匙开始拿就好了。
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<set>
#include<stack>
#include<vector>
#include<map>
#include<queue>
#define pi acos(-1)
#define maxn 111111
#define maxm 11111
#define INF 0x3F3F3F3F
#define eps 1e-8
#define pb push_back
#define mem(a) memset(a,0,sizeof a)
using namespace std ;
const long long mod = 1000000007 ;
void init() {
}
int a[2222 ], b[2222 ];
int main() {
int n, k, p;
while (scanf ("%d%d%d" , &n, &k, &p) != EOF) {
for (int i = 1 ; i <= n; i++) {
scanf ("%d" , a + i);
}
for (int i = 1 ; i <= k; i++) {
scanf ("%d" , b + i);
}
sort(a + 1 , a + n + 1 );
sort(b + 1 , b + k + 1 );
int ans = INF * 2 ;
for (int i = 1 ; i + n - 1 <= k; i++) {
int tot = 0 ;
for (int j = 1 ; j <= n; j++) {
tot = max(tot, (int )(fabs (a[j] - b[i + j -1 ]) + fabs (p - b[i + j - 1 ])));
}
ans = min(ans, tot);
}
printf ("%d\n" , ans);
}
return 0 ;
}