Codeforces Beta Round #52 (Div. 2)

Codeforces Beta Round #52 (Div. 2)

http://codeforces.com/contest/56

A

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000005
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;
 
 int n;
 
 int main(){
     #ifndef ONLINE_JUDGE
         freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     cin>>n;
     map<string,int>mp;
     mp["ABSINTH"]++;
     mp["BEER"]++;
     mp["BRANDY"]++;
     mp["CHAMPAGNE"]++;
     mp["GIN"]++;
     mp["RUM"]++;
     mp["SAKE"]++;
     mp["TEQUILA"]++;
     mp["VODKA"]++;
     mp["WHISKEY"]++;
     mp["WINE"]++;
     string str;
     int ans=;
     for(int i=;i<=n;i++){
         cin>>str;
         int tmp=;
         if(str[]>=''&&str[]<=''){
             for(int j=;j<str.length();j++){
                 tmp=tmp*+str[j]-'';
             }
             if(tmp<) ans++;
         }
         else{
             if(mp[str]) ans++;
         }
     }
     cout<<ans<<endl;
 }

B

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000005
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;
 
 int n;
 int a[];
 int book[];
 
 int main(){
     #ifndef ONLINE_JUDGE
        // freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     cin>>n;
     int L=,R=;
     int co=;
     int cc=;
     for(int i=;i<=n;i++) {
         cin>>a[i];
         if(a[i]!=i){
             book[i]=;
             if(L!=) R=i;
             if(L==) L=i;
         }
     }
     int pre=0x3f3f3f3f;
     int flag=;
     for(int i=;i<=n;i++){
         if(book[i]){
             if(pre<a[i]){
                 flag=;
             }
             pre=a[i];
         }
     }
     if(flag) cout<<"0 0"<<endl;
     else{
         cout<<L<<" "<<R<<endl;
     }
 }

C

模拟

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000005
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;
 char S;
 int n,ans;
 string s[];
 
 int main(){
     #ifndef ONLINE_JUDGE
         freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     while(cin>>S)
     {
         if(S=='.')
         {
             for(int i=;i<n;i++)
                 if(s[i]==s[n])
                     ans++;
             s[n]="";
             n--;
         }
         else
             if(S==':' || S==',')
                 n++;
             else
                 s[n]+=S;
     }
     cout<<ans<<endl;
 }

D

DP +路径搜索，基础DP， 类似一道名为编辑距离的题目

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000005
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;
 
 string s1,s2;
 int dp[][];
 
 void dfs(int i,int j){
     if(i==&&j==) return;
     if(i&&dp[i-][j]+==dp[i][j]){
         dfs(i-,j);
         cout<<"DELETE"<<" "<<j+<<endl;
     }
     else if(j&&dp[i][j-]+==dp[i][j]){
         dfs(i,j-);
         cout<<"INSERT"<<" "<<j<<" "<<s2[j-]<<endl;
     }
     else{
         dfs(i-,j-);
         if(s1[i-]!=s2[j-])
         cout<<"REPLACE"<<" "<<j<<" "<<s2[j-]<<endl;
     }
 }
 
 int main(){
     #ifndef ONLINE_JUDGE
         freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     cin>>s1>>s2;
     int len1=s1.length();
     int len2=s2.length();
     rep(i,,len1+) dp[i][]=i;
     rep(i,,len2+) dp[][i]=i;
     dp[][]=;
     rep(i,,len1+){
         rep(j,,len2+){
             dp[i][j]=min(min(dp[i-][j],dp[i][j-])+,dp[i-][j-]+(s1[i-]!=s2[j-]));
         }
     }
     cout<<dp[len1][len2]<<endl;
     dfs(len1,len2);
 }

E

DP  从后往前推，找出符合的距离  。想到逆向思路就很简单了

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000005
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;
 
 int n;
 struct sair{
     int x,h,pos,num;
 }a[];
 
 bool cmp(sair a,sair b){
     return a.x<b.x;
 }
 
 bool cmp1(sair a,sair b){
     return a.pos<b.pos;
 }
 
 int main(){
     #ifndef ONLINE_JUDGE
         freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     cin>>n;
     for(int i=;i<=n;i++){
         cin>>a[i].x>>a[i].h;
         a[i].pos=i;
         a[i].num=;
     }
     sort(a+,a+n+,cmp);
     for(int i=n-;i>=;i--){
         int j=i+;
         while(j<=n&&a[i].x+a[i].h>a[j].x){
             a[i].num+=a[j].num;
             j=a[j].num+j;
         }
     }
     sort(a+,a+n+,cmp1);
     for(int i=;i<=n;i++){
         cout<<a[i].num<<" ";
     }
 
 }