20200220(ABC)

传送门

A - Petya and Java

这道题的题意是判断数是byte、short、int、long、Bingter的范围
（1）首先这个数不能用long long 输入，所以想到了字符串或者字母
（2）然后题目也给出了范围，想到可以用字典序来比较两个字符串的大小
（3）1245和2按照字典序是2大的，可是如果是数字的话显然1245更大，
所以我们比较字典序必须要等长，如果长度小的话肯定是比数小的。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
string s2="128",s4="32768",s6="2147483648",s8="9223372036854775808";
string a;
string a2="127",a4="32767",a6="2147483647",a8="9223372036854775807";
int main(){
	cin>>s;
	if(s[0]=='-'){
		a=s.substr(1,s.length()-1);
		if(a.length()<s2.length()){
			cout<<"byte"<<endl;
			return 0;
		}
		if(a<=s2&&a.length()==s2.length()){
			cout<<"byte"<<endl;
			return 0;
		}
		if(a.length()<s4.length()){
			cout<<"short"<<endl;
			return 0;
		}
		if(a<=s4&&a.length()==s4.length()){
			cout<<"short"<<endl;
			return 0;
		}
		if(a.length()<s6.length()){
			cout<<"int"<<endl;
			return 0;
		}
		if(a<=s6&&a.length()==s6.length()){
			cout<<"int"<<endl;
			return 0;
		}
		if(a.length()<s8.length()){
			cout<<"long"<<endl;
			return 0;
		}
		else if(a<=s8&&a.length()==s8.length()){
			cout<<"long"<<endl;
			return 0;
		}
		else{
	    cout<<"BigInteger"<<endl;
		}
	}
	else{
		if(s.length()<a2.length()){
			cout<<"byte"<<endl;
			return 0;
		}
	if(s<=a2&&s.length()==a2.length()){
		cout<<"byte"<<endl;
		return 0;
	}
	if(s.length()<a4.length()){
		cout<<"short"<<endl;
		return 0;
	}
	if(s<=a4&&s.length()==a4.length()){
		cout<<"short"<<endl;
		return 0;
	}
	if(s.length()<a6.length()){
		cout<<"int"<<endl;
		return 0;
	}
	if(s<=a6&&s.length()==a6.length()){
		cout<<"int"<<endl;
		return 0;
	}
	if(s.length()<a8.length()){
		cout<<"long"<<endl;
		return 0;
	}
	if(s<=a8&&s.length()==a8.length()){
		cout<<"long"<<endl;
		return 0;
	}
	else 
	cout<<"BigInteger"<<endl;		
	}
	return 0;
}

B - Petya and Countryside

由于n<=1000,所以想到直接暴力

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e3+10;
int s[maxn];
int n;
int sum,cnt;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&s[i]);
	}
	for(int i=1;i<=n;i++){
			int j=i;
			cnt=0;
			j--;
			int num=s[i];
			while(j>=1){
				if(s[j]>num)
				break;
				if(s[j]==num){
					cnt++;
				}
				if(s[j]<num){
					cnt++;
					num=s[j];
				}
				j--;
			}
			j=i;
			j++;
			num=s[i];
			while(j<=n){
				if(s[j]>num)
				break;
				if(s[j]==num){
					cnt++;
				}
				if(s[j]<num){
					cnt++;
					num=s[j];
				}
				j++;
			}
			sum=max(sum,cnt+1);
	}
	printf("%d\n",sum);
	return 0;
}

C - Petya and File System

这道题还要在研究一下写法
C:\folder1\folder2\folder4\file1.txt

这道题的做法是用map挨个 分割，如分割folder2，分割成C:\folder1\folder2
set 不含重复的元素

#include<iostream>
#include<cstdio>
#include<string>
#include<set>
#include<map>
using namespace std;
map<string,set<string> >p;
map<string,int> b;
string s,a;
int sum,sum_;
int main(){
    while(getline(cin,s)){
        if(s[0]=='\0')
        break;
        int k=0;
//        cout<<s<<endl;
        for(int i=0;i<s.length();i++){
            if(s[i]=='\\'){
                k++;
                  if(k==2) a=s.substr(0,i),b[a]++;
                  if(k>2){
                p[a].insert(s.substr(0,i));
//                      cout<<s.substr(0,i)<<endl;
                  }
            }
        }
        sum=max(sum,b[a]);
    }
    for(auto &it:p)sum_=max(sum_,(int)it.second.size());
        printf("%d %d\n",sum_,sum);
        return 0;
}