HDU-6045 Is Derek lying? (判断)
题意:给出N,X,Y,代表有N个选择题,以及两个字符串代表两位同学的答案。D同学说他能得到X分,说A同学能得到Y分,请问他是否撒谎。
题解:求出两个字符串对应位不同字符的有多少位。然后看代码吧。
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int N, X, Y;
char a[80010], b[80010];
int main(){
int T;
scanf("%d", &T);
while(T--){
scanf("%d %d %d", &N, &X, &Y);
scanf("%s", a);
scanf("%s", b);
int cha = 0;
for(int i = 0; i<N; i++){
if(a[i]!=b[i]){
cha++;
}
}
if(X>N || Y>N){
cout<<"Lying"<<endl;
}
else if(cha<abs(X-Y)){
cout<<"Lying"<<endl;
}
else if(X+Y>2*N-cha){
cout<<"Lying"<<endl;
}
else{
cout<<"Not lying"<<endl;
}
}
return 0;
}
HDU-6047 Maximum Sequence(线段树+贪心)
题意:给两个含n个元素的数列,a,b。要求构造a[n+1]到a[2*n]。构造a[i]的方式为:从b中选一个数k,然后a[i] = max(a[j]-j, k<=j<i)。最后求最大的sum(a[i], n+1<=i<=2*n)。
题解:b排序,从小到大选k。线段树可以求出k~i-1的最大(a[i]-i)
代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
int n;
long long a[500010], b[500010];
const long long mod = 1e9+7;
struct node{
int l, r, ma;
}s[500010*4];
void build(int l, int r, int k){
s[k].l = l; s[k].r = r;
if(l == r){
s[k].ma = a[l];
return;
}
int mid = (l+r)>>1;
build(l, mid, 2*k);
build(mid+1, r, 2*k+1);
s[k].ma = max(s[2*k].ma, s[2*k+1].ma);
}
void update(int pos, long long c, int k){
if(s[k].l == s[k].r && s[k].l == pos){
s[k].ma = c;
return;
}
int mid = (s[k].l+s[k].r)>>1;
if(pos<=mid) update(pos, c, 2*k);
else update(pos, c, 2*k+1);
s[k].ma = max(s[2*k].ma, s[2*k+1].ma);
}
long long query(int l, int r, int k){
if(s[k].l == l && s[k].r == r){
return s[k].ma;
}
int mid = (s[k].l+s[k].r)>>1;
if(r<=mid) return query(l, r, 2*k);
else if(l>mid) return query(l, r, 2*k+1);
else return max(query(l, mid, 2*k), query(mid+1, r, 2*k+1));
}
int main(){
while(scanf("%d", &n)!=EOF){
memset(a, 0, sizeof(a));
for(int i = 0; i<500005*4; i++){
s[i].l = s[i].r = s[i].ma = 0;
}
for(int i = 1; i<=n; i++){
scanf("%d", &a[i]);
a[i] = a[i]-i;
}
build(1, 2*n, 1);
for(int i = 1; i<=n; i++){
scanf("%d", &b[i]);
}
sort(b+1, b+1+n);
long long res = 0;
for(int i = 1; i<=n; i++){
long long temp = query(b[i], n+i-1, 1);
res = (res%mod+temp%mod+mod)%mod;
update(n+i, temp-(n+i), 1);
}
printf("%lld\n", res%mod);
}
return 0;
}