Codeforces Round #350 (Div. 2) ABCDE

传送门：http://codeforces.com/contest/670

A（写的很啰嗦...）：

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int INF=0x3f3f3f3f;
const int maxn=1000005;
int T,n,m;

int main(){
	while(~scanf("%d",&n)){
		int maximum,minimum;
		if(n<=2) maximum=n;
		else{
			m=n-2;
			maximum=m/7*2+2;
			int num=m-m/7*7-5;
			if(num>=0){
				maximum+=num;
			}
		}
		int tmp2=n/7*2;
		int num=(n-n/7*7-5);
		if(num>=0)
			minimum=tmp2+num;
		else
			minimum=tmp2;
		printf("%d %d\n",minimum,maximum);
	}
    return 0;
}

B(找规律就好了...)：

#include <bits/stdc++.h>
using namespace std;

typedef __int64 ll;
const int INF=0x3f3f3f3f;
const int maxn=100005;
int T;
ll n,m;
int a[maxn];

int main(){
	while(~scanf("%I64d%I64d",&n,&m)){
		for(int i=1;i<=n;i++) scanf("%d",&a[i]);
		ll i=1;
		while(i*(i+1)/2<=m) i++;
		i--;
		int num=i*(i+1)/2;
		if(num==m) printf("%d\n",a[i]);
		else{
			printf("%d\n",a[m-num]);
		}
	}
	return 0;
}

C：

用map记录一下，然后扫一遍，O（n）就可以了(STL大法好！)

#include <bits/stdc++.h>
using namespace std;

const int INF=0x3f3f3f3f;
const int maxn=200005;
int T,n,m;
int a[maxn],b[maxn],c[maxn];

int main(){
	while(~scanf("%d",&n)){
		map<int,int>mp;
		for(int i=1;i<=n;i++) {
			scanf("%d",&a[i]);
			mp[a[i]]++;
		}
		scanf("%d",&m);
		for(int i=1;i<=m;i++) scanf("%d",&b[i]);
		for(int i=1;i<=m;i++) scanf("%d",&c[i]);
		int max=0;
		for(int i=1;i<=m;i++) {
			if(mp[b[i]]&&mp[b[i]]>max){
				max=mp[b[i]];
			}
		}
		int num=0,index=-1;
		map<int,int>flag;
		for(int i=1;i<=m;i++) {
			if(mp[b[i]]==max){
				flag[b[i]]=1;
				index=i;
				num++;
			}
		}
		if(num==1) printf("%d\n",index);
		else{
			int maxx=-1;
			for(int i=1;i<=m;i++){
				if(flag[b[i]]){
					if(mp[c[i]]>maxx){
						maxx=mp[c[i]];
						index=i;
					}
				}
			}
			printf("%d\n",index);
		}
	}
	return 0;
}

D：

用二分枚举可行值，记录一下ans即可，注意大数

#include <bits/stdc++.h>
using namespace std;

typedef __int64 ll;
const ll INF=0x3f3f3f3f;
const ll maxn=100005;
ll T,n,m,k;
ll a[maxn],b[maxn];

bool judge(ll mid,ll k){
	for(ll i=1;i<=n;i++){
		ll num=mid*a[i];
		if(num>b[i])
			k-=num-b[i];
		if(k<0)
			return false;
	}
	return true;
}

int main(){
	while(~scanf("%I64d%I64d",&n,&k)){
		for(ll i=1;i<=n;i++)
			scanf("%I64d",&a[i]);
		ll low=0,high=-INF;
		for(ll i=1;i<=n;i++) {
			scanf("%I64d",&b[i]);
			ll num=(b[i]+k)/a[i];
			if(num>high) high=num;
		}
		ll ans=0;
		while(low<=high){
			ll mid=(low+high)>>1;
			if(judge(mid,k)){
				low=mid+1;
				ans=mid;
			}
			else{
				high=mid-1;
			}
		}
		printf("%I64d\n",ans);
	}
	return 0;
}

E：

（感觉也是STL吧(?)）先模拟栈操作匹配括号，然后模拟链表操作

#include <bits/stdc++.h>
using namespace std;

typedef __int64 ll;
const int INF=0x3f3f3f3f;
const int maxn=500005;
int T,n,m,pos;
char str[maxn],op[maxn];
int a[maxn],d[maxn];

struct Node{
	int l;
	int r;
}p[maxn];

int main(){
#ifndef ONLINE_JUDGE
	freopen("test.in","r",stdin);
	freopen("test.out","w",stdout);
#endif
	while(~scanf("%d%d%d",&n,&m,&pos)){
		scanf("%s%s",str+1,op+1);
		for(int i=0;i<=n+1;i++)
			p[i].l=i-1,p[i].r=i+1;
		int top=0;
		int len=strlen(str+1);
		for(int i=1;i<=len;i++){
			if(str[i]=='(') a[top++]=i;
			else d[i]=a[--top],d[a[top]]=i;
		}
		int len2=strlen(op+1);
		for(int i=1;i<=len2;i++){
			if(op[i]=='R'){
				pos=p[pos].r;
			}
			else if(op[i]=='L'){
				pos=p[pos].l;
			}
			else{
				int l=min(d[pos],d[d[pos]]);
				int r=max(d[pos],d[d[pos]]);
				p[p[l].l].r=p[r].r;
				p[p[r].r].l=p[l].l;
				pos=p[r].r;
				if(pos==n+1) pos=p[pos].l;
				if(pos==0) pos=p[pos].r;
			}
		}
		int pos=p[0].r;
		while(pos<=len){
			printf("%c",str[pos]);
			pos=p[pos].r;
		}
		putchar(10);
	}
	return 0;
}