1.Cinema
离散化:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include<bitset>
#include<list>
#include <algorithm>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define pil pair<int,LL>
#define pli pair<LL,int>
#define pdd pair<db,db>
#define se second
#define fi first
#define endl '\n'
#define rep(i,a,b) for (register int i=a;i<b;++i)
#define per(i,a,b) for (register int i=a;i>b;--i)
#define MEM(a,x) memset(a,x,sizeof(a))
#define M(x) ((x)%MOD)
#define db double
#define eps 1e-9
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
const int MOD=9901;
const int N=2e5+10;
int idx;
int a[N],b[N],c[N];
vector<int>v;
int query(int x)
{
return lower_bound(v.begin(),v.end(),x)-v.begin();
}
int cnt[3*N];
void solve()
{
int n;
cin>>n;
rep(i,0,n) cin>>a[i],v.push_back(a[i]);
int m;
cin>>m;
rep(i,0,m) cin>>b[i],v.push_back(b[i]);
rep(i,0,m) cin>>c[i],v.push_back(c[i]);
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
rep(i,0,n) ++cnt[query(a[i])];
int mxp=0,mx1=cnt[query(b[0])],mx2=cnt[query(c[0])];
rep(i,1,m){
int val1=cnt[query(b[i])],val2=cnt[query(c[i])];
if(val1>mx1) mx1=val1,mxp=i,mx2=val2;
else if(val1==mx1){
if(val2>mx2) mx2=val2,mxp=i;
}
}
cout<<mxp+1;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("title.in","r",stdin);
freopen("title.out","w",stdout);
#endif
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int _=1;
//cin>>_;
while(_--){
solve();
}
return 0;
}
直接用map:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include<bitset>
#include<list>
#include <algorithm>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define pil pair<int,LL>
#define pli pair<LL,int>
#define pdd pair<db,db>
#define se second
#define fi first
#define endl '\n'
#define rep(i,a,b) for (register int i=a;i<b;++i)
#define per(i,a,b) for (register int i=a;i>b;--i)
#define MEM(a,x) memset(a,x,sizeof(a))
#define M(x) ((x)%MOD)
#define db double
#define eps 1e-9
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
const int MOD=9901;
const int N=2e5+10;
int idx;
int a[N],b[N],c[N];
map<int,int>mp;
void solve()
{
int n,m;
cin>>n;
rep(i,0,n) cin>>a[i],++mp[a[i]];
cin>>m;
rep(i,1,m+1) cin>>b[i];
rep(i,1,m+1) cin>>c[i];
int mxp=1,mx1=mp[b[1]],mx2=mp[c[1]];
rep(i,2,m+1){
int val1=mp[b[i]],val2=mp[c[i]];
if(val1>mx1) mx1=val1,mxp=i,mx2=val2;
else if(val1==mx1){
if(val2>mx2) mx2=val2,mxp=i;
}
}
cout<<mxp;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("title.in","r",stdin);
freopen("title.out","w",stdout);
#endif
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int _=1;
//cin>>_;
while(_--){
solve();
}
return 0;
}
2.货仓选址
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int a[N];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
int x=a[n/2];
long long ans=0;
for(int i=0;i<n;i++) ans+=abs(x-a[i]);
cout<<ans;
return 0;
}
3.七夕祭
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include<bitset>
#include<list>
#include <algorithm>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define pil pair<int,LL>
#define pli pair<LL,int>
#define pdd pair<db,db>
#define se second
#define fi first
#define endl '\n'
#define rep(i,a,b) for (register int i=a;i<b;++i)
#define per(i,a,b) for (register int i=a;i>b;--i)
#define MEM(a,x) memset(a,x,sizeof(a))
#define M(x) ((x)%MOD)
#define db double
#define eps 1e-9
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
const int MOD=9901;
const int N=1e5+10;
int cl,c[N],r[N];
LL s[N];
LL cal(int a[],int n,int t)
{
rep(i,1,n+1) s[i]=s[i-1]+a[i]-t;
sort(s+1,s+1+n);
LL ans=0;
LL mid=s[n/2+1];
rep(i,1,n+1) ans+=abs(mid-s[i]);
return ans;
}
void solve()
{
int n,m;
LL tr=0,tc=0;
cin>>n>>m>>cl;
while(cl--){
int x,y;
cin>>x>>y;
++r[x],++c[y];
}
rep(i,1,n+1) tr+=r[i];
rep(i,1,m+1) tc+=c[i];
if(tr%n==0&&tc%m==0) cout<<"both"<<" "<<cal(r,n,tr/n)+cal(c,m,tc/m);
else if(tr%n==0) cout<<"row"<<" "<<cal(r,n,tr/n);
else if(tc%m==0) cout<<"column"<<" "<<cal(c,m,tc/m);
else cout<<"impossible";
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("title.in","r",stdin);
freopen("title.out","w",stdout);
#endif
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int _=1;
//cin>>_;
while(_--){
solve();
}
return 0;
}
4.Running Median
每一次检查两个数,如果假设一个排好了序列中位数是x,可以发现如果插入的两个数如果都大于等于x,则将中位数变成x后面的一个数;如果都小于x,中位数往前面移一个。这里可以偷个懒,让multiset帮我们动态维护递增序列,每一次插入两个数时检查移动指针即可。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include<bitset>
#include<list>
#include <algorithm>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define pil pair<int,LL>
#define pli pair<LL,int>
#define pdd pair<db,db>
#define se second
#define fi first
#define endl '\n'
#define rep(i,a,b) for (register int i=a;i<b;++i)
#define per(i,a,b) for (register int i=a;i>b;--i)
#define MEM(a,x) memset(a,x,sizeof(a))
#define M(x) ((x)%MOD)
#define db double
#define eps 1e-9
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
const int MOD=9901;
const int N=25;
void solve()
{
int ca,n;
cin>>ca>>n;
cout<<ca<<" "<<n/2+n%2<<endl;
multiset<int>st;
int x,y;
cin>>x;
st.insert(x);
multiset<int>::iterator it=st.begin();
cout<<*it<<" ";
for(int i=2;i+1<=n;i+=2){
cin>>x>>y;
st.insert(x),st.insert(y);
if(x>=*it&&y>=*it) ++it;
if(x<*it&&y<*it) --it;
cout<<*it<<" ";
if((i/2+1)%10==0) cout<<endl;
}
if((n/2+n%2)%10) cout<<endl;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("title.in","r",stdin);
freopen("title.out","w",stdout);
#endif
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int _=1;
cin>>_;
while(_--){
solve();
}
return 0;
}
5.Ultra-QuickSort
#include<bits/stdc++.h>
#define endl '\n'
#define rep(i,a,b) for (register int i=a;i<b;++i)
#define per(i,a,b) for (register int i=a;i>b;--i)
using namespace std;
const int N=500010;
int a[N],b[N],cnt;
void merge(int l,int r)
{
if(l>=r) return;
int m=l+r>>1;
merge(l,m),merge(m+1,r);
int i=l,j=m+1;
rep(k,l,r+1)
if(j>r||i<=m&&a[i]<=a[j]) b[k]=a[i++];
else b[k]=a[j++],cnt+=m-i+1;
rep(k,l,r+1) a[k]=b[k];
}
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n;
while(cin>>n){
if(n==0) break;
cnt=0;
rep(i,0,n) cin>>a[i];
merge(0,n-1);
cout<<cnt<<endl;
}
return 0;
}
6.奇数码问题
#include<bits/stdc++.h>
#define rep(i,a,b) for (register int i=a;i<b;++i)
using namespace std;
const int N=510;
int a[N*N],n,b[N*N];
void merge(int l,int r,int &cnt)
{
if(l>=r) return;
int mid=l+r>>1;
merge(l,mid,cnt),merge(mid+1,r,cnt);
int i=l,j=mid+1;
rep(k,l,r+1)
if(j>r||i<=mid&&a[i]<=a[j]) b[k]=a[i++];
else b[k]=a[j++],cnt+=mid-i+1;
rep(k,l,r+1) a[k]=b[k];
}
void deal(int &cnt)
{
int id=0;
rep(i,0,n*n){
int x;
cin>>x;
if(x) a[id++]=x;
}
merge(0,id-1,cnt);
}
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
while(cin>>n){
int cnt1=0,cnt2=0;
deal(cnt1);
deal(cnt2);
if((cnt1&1)==(cnt2&1)) cout<<"TAK"<<endl;
else cout<<"NIE"<<endl;
}
return 0;
}