【Codeforces】【#FF Div.2】【题解】

rating+了100好开心>_<

A题

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int hash[300];
int main(){
	int p,n,ok=0;
	cin>>p>>n;
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		if(hash[x%p]){
			cout<<i<<endl;ok=1;
			return 0;
		}hash[x%p]=1;
	}
	if(!ok)cout<<-1<<endl;
	return 0;
} 

B题

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
string s;
int k,maxx,pos;
int w[27];
int main(){
	cin>>s;
	cin>>k;
	for(int i=1;i<=26;i++){
		cin>>w[i];
		if(maxx<w[i]){
			maxx=w[i];
			pos=i;
		}
	}while(k--)s.push_back((char)pos+'a'-1);
	long long ans=0;
	for(int i=0;i<s.length();i++)ans+=w[s[i]-'a'+1]*(i+1);
	cout<<ans<<endl;
	return 0;
}

C题

#include<vector>
#include<cstdio>
#include<climits>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e5+10;
int a[maxn],d[maxn],size=0,n;
int first[maxn],last[maxn];
vector<int>v[maxn];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=1;i<n;i++){
		if(a[i]<a[i+1]){
			v[size].push_back(a[i]);
		}else {
			v[size].push_back(a[i]);
			size++;
		}
	}v[size].push_back(a[n]);
	int ans=v[0].size();
	if(size)
	for(int i=0;i<=size;i++)
	ans=max(ans,(int)v[i].size()+1);
	for(int i=0;i<size;i++){
		
		int res=0;
		res=v[i].size();
		if(v[i+1].size()==1){
			res++;
			if(i+2<=size){
				if(v[i+2].front()>v[i].back()+1)
				res+=v[i+2].size();
			}
		}		
		else
			if(v[i+1][1]>v[i].back()+1)
			res+=v[i+1].size();
		else
			if(v[i][v[i].size()-2]+1<v[i+1].front())
			res+=v[i+1].size();
		ans=max(ans,res);
	}
	cout<<ans<<endl;
	return 0;
}

D题

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const long long maxn=1e3+10;
const long long maxk=1e6+10;
long long x[maxn],y[maxn];
long long ans1[maxk],ans2[maxk];
priority_queue<long long>q;
long long getlonglong(){
	long long x;scanf("%I64d",&x);return x;
}
long long n,m,k,p;
int main(){
	n=getlonglong(),m=getlonglong(),k=getlonglong(),p=getlonglong();
	for(long long i=1;i<=n;i++)
	for(long long j=1;j<=m;j++){
		long long d=getlonglong();
		x[i]+=d;y[j]+=d;
	}
	for(long long i=1;i<=n;i++)
		q.push(x[i]);
	for(long long i=1;i<=k;i++){
		long long d=q.top();q.pop();
		ans1[i]=ans1[i-1]+d;
		q.push(d-p*m);
	}while(!q.empty())q.pop();	
	for(long long i=1;i<=m;i++)	
		q.push(y[i]);
	for(long long i=1;i<=k;i++){
		long long d=q.top();q.pop();
		ans2[i]=ans2[i-1]+d;
		q.push(d-p*n);
	}
	long long ans=ans1[k];
	for(long long i=0;i<=k;i++)
		ans=max(ans,ans1[i]+ans2[k-i]-(long long)(k-i)*i*p);	
	cout<<ans<<endl;
	return 0;
}