D.Game HDU - 6312
先手必赢,但是前两发交成YES了
#include<iostream>
using namespace std;
int n;
int main(){
while(cin>>n){
cout<<"Yes"<<endl;
}
}
J.Swaps and Inversions HDU - 6318
把题给读错了,题意是:1.当有一个逆序对时给x元。2.可以有一个操作使得相邻的两个元素互换。2的操作本质就是减少一对逆序对,所以这道题就直接归并求逆序对,然后比较x,y的大小。最后ans=cnt*min(x,y);
#include<iostream>
#include<cstdio>
#define ll long long
using namespace std;
const int maxn = 1e5+500;
int b[maxn];
ll ans;
ll n,x,y;
void mergearray(int a[], int first, int mid, int last, int temp[]) {
int i = first, j = mid + 1;
int m = mid, n = last;
int k = 0;
while (i <= m && j <= n) {
if (a[i] <= a[j])
temp[k++] = a[i++];
else{
ans+=m-i+1;//这里是关键
temp[k++] = a[j++];
}
}
while (i <= m)
temp[k++] = a[i++];
while (j <= n)
temp[k++] = a[j++];
for (i = 0; i < k; i++)
a[first + i] = temp[i];
}
void mergesort(int a[], int first, int last, int temp[]) {
if (first < last) {
int mid = (first + last) / 2;
mergesort(a, first, mid, temp); //左边有序
mergesort(a, mid + 1, last, temp); //右边有序
mergearray(a, first, mid, last, temp); //再将二个有序数列合并
}
}
bool MergeSort(int a[], int n) {
int *p = new int[n];
if (p == NULL)
return false;
mergesort(a, 0, n - 1, p);
delete[] p;
return true;
}
int main(){
while(cin>>n>>x>>y){
ans=0;
for(int i=0;i<n;i++){
scanf("%d",&b[i]);
}
MergeSort(b,n);
if(x>y)ans*=y;
else ans*=x;
cout<<ans<<endl;
}
}
G.Naive Operations HDU - 6315
两个线段树,一个维护最小值,一个维护sum,策略是,把所有节点的初值赋值为b[i],建一棵树。然后,add操作的时候,若当前最小值不等于1时,此节点就-1,然后lazy_tag+=1,当此节点==1的时候,就往下面节点递归,递归到叶子节点的时候,再给此区间的sum++,然后此节点重新置为b[i]。
#include<iostream>
#include<stdio.h>
#define ll long long
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using namespace std;
const int MAXN=1e5+10;
ll sum[MAXN<<2];
ll add[MAXN<<2];
ll a[MAXN<<2];
int b[MAXN];
int n,m;
void push_up(int rt){
sum[rt]=sum[rt<<1]+sum[rt<<1|1];
a[rt]=min(a[rt<<1],a[rt<<1|1]);
}
void push_down(int rt){
if(add[rt]){
add[rt<<1]+=add[rt];
add[rt<<1|1]+=add[rt];
a[rt<<1]-=add[rt];
a[rt<<1|1]-=add[rt];
add[rt]=0;
}
}
void build(int l,int r,int rt){
add[rt]=0;sum[rt]=0;
if(l==r){
a[rt]=b[l];
return;
}
int mid=(l+r)>>1;
build(lson);
build(rson);
push_up(rt);
}
void update(int L,int R,ll key,int l,int r,int rt){
if(L<=l&&R>=r&&a[rt]>1){
add[rt]++;
a[rt]--;
return;
}
if(a[rt]==1&&l==r){
sum[rt]++;
add[rt]=0;
a[rt]=b[l];
return;
}
push_down(rt);
int mid=(l+r)>>1;
if(L<=mid)update(L,R,key,lson);
if(R>mid)update(L,R,key,rson);
push_up(rt);
}
ll query(int L,int R,int l,int r,int rt){
if(L<=l&&R>=r)return sum[rt];
if(a[rt]==0)update(L,R,1,1,n,1);
push_down(rt);
int mid=(l+r)>>1;
ll ans=0;
if(L<=mid)ans+=query(L,R,lson);
if(R>mid)ans+=query(L,R,rson);
push_up(rt);
return ans;
}
int main(){
while(cin>>n>>m){
for(int i=1;i<=n;i++){
scanf("%lld",&b[i]);
}
build(1,n,1);
while(m--){
char str[10];
int x,y;
ll z;
scanf("%s",str);
if(str[0]=='a'){
scanf("%d%d",&x,&y);
update(x,y,1,1,n,1);
}else{
scanf("%d%d",&x,&y);
printf("%lld\n",query(x,y,1,n,1));
}
}
}
}