水一发

http://codeforces.com/problemset/problem/602/B 最大的稳定子序列

#include<iostream>
using namespace std;
#define MAX 100002
struct P
{
    int v,t;
} p[MAX];
int main()
{
    int n,tem;
    cin>>n;
    for(int i=0; i<n; i++)
    {
        p[i].v=0;
        p[i].t=0;
    }
    cin>>p[0].v;
    p[0].t=1;
    int l=1;/// 不同元素个数
    for(int i=1; i<n; ++i)
    {
        cin>>tem;
        if(tem==p[l-1].v)
            p[l-1].t++;///次数++
        else
        {
            p[l].v=tem;
            p[l].t++;
            l++;
        }
    }

    int maxx=0; ///结果
    struct P tt=p[0];  ///第一数
    for(int i=1; i<l; i++)
    {
        int ans=0;
        if(abs(p[i].v-tt.v)<=1)
        {
            int f=p[i].v;
            ans+=p[i].t;
            ans+=tt.t;
            int flag=0;
            while(p[i+1].v==tt.v||f==p[i+1].v)
            {
                ans+=p[i+1].t;
                i++;
                flag=1;
            }
            if(flag)i--;
            tt=p[i];
           //  cout<<"---"<<ans<<endl;
            maxx=max(maxx,ans);

        }
    }
    if(maxx==0)cout<<p[0].t<<endl;
    else
    cout<<maxx<<endl;
    return 0;
}

 http://codeforces.com/problemset/problem/554/B 扫垃圾（水)

#include<iostream>
#include<map>
using namespace std;
map<string,int> mp;
int main()
{
    int n,maxx;
    string s;
    cin>>n;
    maxx=0;
    for(int i=0; i<n; i++)
    {
        cin>>s;
        mp[s]++;
        maxx=max(maxx,mp[s]);
    }
    cout<<maxx<<endl;
    return 0;
}

 CSU 1783 聊天止于呵呵

#include<iostream>
#include<cstdio>
#include<string.h>
#include<sstream>
#include<map>
using namespace std;
struct P
{
    string user,str;
    int point;
} p[1002];
map<string,int> mp;
char cp(char c)
{
    if(c>='0'&&c<='9')
        return c;
    if(c>='a'&&c<='z')
        return c;
    if(c>='A'&&c<='Z')
        return c+' ';
    return ' ';
}
int hh(string s)
{
    if(s.length()&1||s.length()<4)return 0;
    for(int i=0; i<s.length()-1; i+=2)
        if(s[i]!='h'&&s[i+1]!='e')
            return 0;
    return 1;
}
int main()
{
    char s[1002];
    int ii=0;
    while(cin.getline(s,1002))
    {
        string u="";
        for(int i=0; i<4; i++)
        {
            u+=s[i];
            s[i]=' ';
        }
        if(u[0]=='-')break;
        if(u[0]>u[3])
        {
            char t=u[0];
            u[0]=u[3];
            u[3]=t;
        }
        for(int i=0; i<strlen(s); i++)
            s[i]=cp(s[i]);
        for(int i=0; i<ii; i++)
            if(u==p[i].user)
                p[i].user="";
        p[ii].user=u;
        p[ii].str=s;
        p[ii].point=ii;
        ii++;
    }
    int cut=0;
    int sum=0;
    for(int i=0; i<ii; i++)
        if(p[i].user!="")
        {
            cut++;
            string sss;
            for(istringstream sin(p[i].str); sin>>sss;)
                if(hh(sss))
                {
                    sum+=1;
                    break;
                }
        }
    int ans = (double)sum/cut*100+0.5;
    cout<<ans<<"%"<<endl;
    return 0;
}

 CSU 1779 错误的算法

#include<iostream>
#include<string.h>
using namespace std;
#define MAX 502
int a[MAX][MAX];
int main()
{
    int n,m,i,j;
    int Case=1;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        memset(a,0,sizeof(a));
        for(i=0; i<n; i++)
        {
            for(j=0; j<m; j++)
            {
                scanf("%d",&a[i][j]);
                a[i][m]+=a[i][j];
                a[n][j]+=a[i][j];
            }
        }
        int eans=0;
        int fm=0;
        int x=-1,y=-1;
        for(i=0; i<n; i++)
            if(fm<a[i][m])
            {
                fm=a[i][m];
                x=i;
            }
        eans+=fm;
        fm=0;
        for(i=0; i<m; i++)
            if(fm<a[n][i])
            {
                fm=a[n][i];
                y=i;
            }
        eans+=fm;
        eans-=a[x][y];
        int ans = 0;
        for(i=0; i<n; i++)
            for(j=0; j<m; j++)
                ans= max(ans,a[i][m]+a[n][j]-a[i][j]);

        if(eans==ans)
            cout<<"Case "<<Case<<": Weak"<<endl;
        else
            cout<<"Case "<<Case<<": Strong"<<endl;
        Case++;
    }
    return 0;
}

 CSU 1785 又一道简单题

#include<iostream>
using namespace std;
int main()
{
    int T,i;
    scanf("%d",&T);
    for(int k=1 ; k <= T ; k++)
    {
        int n;
        scanf("%d",&n);
        int ans  = 0;
        for(i=32;i<100;i++)
        {
            int x = i*i;
            if( n == x) continue ;
            if( x/10 == n/10 )
            ans += 1;
            if( x%1000 == n%1000)
            ans += 1;
            if( x/100*10+x%10 == n/100*10+n%10 )
            ans += 1;
            if( x/1000*100+x%100 == n/1000*100+n%100)
            ans += 1;
        }
        cout<<"Case "<<k<<": "<<ans<<endl;
    }
    return 0;
}

 codeforces 785B 区间问题 （最晚的开始，最早的结束）

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int n,m;
    scanf("%d",&n);
    int xs=0,xe=0x7fffffff;
    int ps=0,pe=0x7fffffff;
    int x,y;
    for(int i = 0; i < n; ++i)
    {
        scanf("%d%d",&x,&y);
        xs=max(xs,x);
        xe=min(xe,y);
    }
    scanf("%d",&m);
    for(int j = 0; j < m; ++j)
    {
        scanf("%d%d",&x,&y);
        ps=max(ps,x);
        pe=min(pe,y);
    }
    int ans1 = 0,ans2 = 0;
    if( ps > xe)
        ans1 = ps - xe;
    if( xs > pe)
        ans2 = xs - pe;
    cout<<max(ans1,ans2)<<endl;
    return 0;
}

 VIJOS 卡布列克圆舞曲 (对数分解取最大和最小相减，形成规律数列

#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
#define ll long long
#define N 1004
ll len(ll n)
{
    ll l = 0;
    while(n > 0)
    {
        n /= 10;
        ++l;
    }
    return l;
}
ll getMaxOrMin(ll n,ll flag)//得到一个数将其数字重排的最大值和最小值
{
    ll a[len(n)] = {0};
    ll j = 0;
    ll nn=n;
    for(ll i = 0; i < len(n); ++i)
    {
        a[j] = nn % 10;
        nn /= 10;
        ++j;
    }
    sort(a,a+j);
    ll ans = 0;
    if(!flag)
    {
        ans = a[0];
        for(ll i = 1; i < len(n); ++i)
            ans = ans * 10 + a[i];
    }
    else
    {
        ans = a[len(n)-1];
        for(ll i = len(n)-2; i>=0; i--)
            ans = ans * 10 + a[i];
    }
    return ans;
}

ll a[N];

int main()
{
    ll n;
    while( cin>>n )
    {
        ll j = 1,flag = 0;
        a[0] = n;
        while(1)
        {
            a[j] = getMaxOrMin(n,1) - getMaxOrMin(n,0);

            for(ll i = j-1; i >= 0; i--)
                if(a[j] == a[i])
                {
                    flag=i+1;
                    break;
                }
            if(flag)
            {
                for(ll i = flag-1; i < j-1; i++)
                    cout<<a[i]<<" ";
                cout<<a[j-1]<<endl;
                break;
            }
            n = a[j];
            j++;
        }
    }
    return 0;
}

 山东第六届ACM J 题

问题：给出男女数量，1-1匹配，分成相同的11组，各组男女对数相同，若给出的男女数量满足-》YES 否则，NO

#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
    string s,s1;
    int t;
    cin>>t;
    while(t--)
    {
        int flag = 0,x = 0;
        cin>>s>>s1;
        if(s[0]=='0'&&s1[0]=='0'){cout<<"NO"<<endl;continue;}
        if(s.length()==s1.length())
        {

            int i = 0;
            for(i = 0; i < s.length(); ++i)
                if(s[i]!=s1[i])break;
            if(i==s.length())
            {
                for(int k = 0; k < s.length(); ++k)
                {
                    x = (x*10+(s[k]-'0'))%11;
                }
                if(x==0)
                    flag=1;
            }
        }
        if(flag)
            cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}