A Snow Footprints
只可能出现全R,全L,RRRLLL的情况,另外情况可以模拟一下是不可能出现的
#include<cstdio>
#include<cstring>
const int LMT=1002;
char sec[LMT];
int main(void)
{
int i,n,al=-1,ar=-1,bl=-1,br=-1;
bool hvl=0,hvr=0;
scanf("%d",&n);
scanf("%s",sec);
for(i=0;sec[i];++i)
{
if(sec[i]=='L')
{
if(bl==-1)bl=i;
br=i;
hvl=1;
}
if(sec[i]=='R')
{
hvr=1;
if(al==-1)al=i;
ar=i;
}
}
if(!hvr)
{
printf("%d %d\n",br+1,bl);
return 0;
}
if(!hvl)
{
printf("%d %d\n",al+1,ar+2);
return 0;
}
printf("%d %d\n",al+1,ar+1);
return 0;
}
C Parity Game
#include<cstdio>
/********
找规律题....
one(a)>=one(b)就是yes,
当然one(a)为奇数时,one(a)+1
********/
const int LMT = 1002;
int onea,oneb;
char sec[LMT];
int main(void)
{
int i;
scanf("%s",sec);
for(i = 0; sec[i]; ++i)
onea += sec[i] - '0';
scanf("%s",sec);
for(i = 0; sec[i]; ++i)
oneb += sec[i] - '0';
onea += onea%2;
if (onea >= oneb)printf("YES\n");
else printf("NO\n");
return 0;
}
C Fish Weight
#include <cstdio>
#include <cstring>
#include <algorithm>
const int LMT = 100003;
using namespace std;
/*******
贪心题也....
当b[i]<a[i]是,就假设所有的b[i]类鱼加起来也没有一只a[i]类的大,然后当b[i]>=a[i]时,就假设w[b[i]]==w[a[i]],
主要的目的是在对比过程中进来消耗b的鱼。就假设对比的时候时候时打仗好了,轻的鱼要被重的鱼打死,看最后剩下的两堆,
哪个多.
******/
int a[LMT], b[LMT];
int main(void)
{
int n, m, i, k, now = 0;
scanf("%d%d%d",&n, &m, &k);
for(i=0; i<n; ++i) scanf("%d", &a[i]);
for(i=0; i<m; ++i) scanf("%d", &b[i]);
sort(a, a+n);
sort(b, b+m);
for(i=0; i<n; ++i)
{
while(a[i] > b[now] && now < m) ++now;
if (now >= m)
{
printf("YES\n");
return 0;
}
++now;
}
printf("NO\n");
return 0;
}