SZU5

A - Couple doubi

这种题不要想复杂，直接找规律。找不出规律就打表找规律

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <cctype>
#include <vector>
#include <iterator>
#include <set>
#include <map>
#include <sstream>
using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))
#define pf printf
#define sf scanf
#define spf sprintf
#define pb push_back
#define debug printf("!\n")
#define INF 10000
#define MAXN 5010
#define MAX(a,b) a>b?a:b
#define blank pf("\n")
#define LL long long
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pqueue priority_queue

int k,p;

int main()
{
     int i,j,kase=;
     while(sf("%d%d",&k,&p)==)
     {
            if(k/(p-)%==) pf("YES\n");
            else pf("NO\n");
     }
}

B - ZCC Loves Codefires

贪心

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <cctype>
#include <vector>
#include <iterator>
#include <set>
#include <map>
#include <sstream>
using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))
#define pf printf
#define sf scanf
#define spf sprintf
#define pb push_back
#define debug printf("!\n")
#define INF 10000
#define MAXN 5010
#define MAX(a,b) a>b?a:b
#define blank pf("\n")
#define LL long long
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pqueue priority_queue

int n;

struct node
{
    int t,a;
    double f;
}p[];

int cmp(const node& x,const node& y)
{ return x.f<y.f;}

int main()
{
     int i,j,kase=;
     while(sf("%d",&n)==)
     {
            for(i=;i<n;i++)
              sf("%d",&p[i].t);
            for(i=;i<n;i++)
            {
              sf("%d",&p[i].a);
              p[i].f = (double)p[i].t/p[i].a;
            }
            sort(p,p+n,cmp);

            long long sumt=,res=;

            for(i=;i<n;i++)
            {
                sumt+=p[i].t;
                res+=p[i].a*sumt;
            }
            pf("%I64d\n",res);
     }
}

C - Magical Forest（HDU 4941）

双重MAP

D - Task

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <map>
typedef __int64 ll;
const int N=;
using namespace std;
struct node
{
    int x,y;
}machine[N],tesk[N];
bool cmp(node a,node b)
{
    if(a.x==b.x)
        return a.y>b.y;
    return a.x>b.x;
}
int main()
{
    int n,m,i,j,k,num;
    ll money;
    int temp[];
    while(~scanf("%d%d",&n,&m))
    {
        for(i=;i<n;i++)
            scanf("%d%d",&machine[i].x,&machine[i].y);
        for(i=;i<m;i++)
            scanf("%d%d",&tesk[i].x,&tesk[i].y);
        sort(machine,machine+n,cmp);
        sort(tesk,tesk+m,cmp);
        memset(temp,,sizeof(temp));
        for(i=,j=,money=,num=;i<m;i++)
        {
            while(machine[j].x>=tesk[i].x&&j<n)//标记符合时间条件的机器
            {
                temp[machine[j].y]++;
                j++;
            }
            for(k=tesk[i].y;k<=;k++)//判断是否有能完成测试的机器
            {
                if(temp[k])
                {
                    temp[k]--;
                    num++;
                    money=money+*tesk[i].x+*tesk[i].y;
                    break;
                }
            }
        }
        printf("%d %I64d\n",num,money);
    }
    return ;
}

E - Stupid Tower Defense

dp，分析见：http://blog.csdn.net/u012860063/article/details/38520673

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <cctype>
#include <vector>
#include <iterator>
#include <set>
#include <map>
#include <sstream>
using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))
#define pf printf
#define sf scanf
#define spf sprintf
#define pb push_back
#define debug printf("!\n")
#define INF 10000
#define MAXN 5010
#define MAX(a,b) a>b?a:b
#define blank pf("\n")
#define LL long long
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pqueue priority_queue

LL dp[][];

int main()
{
     int i,j,kase=,T;
     sf("%d",&T);
     while(T--)
     {
        LL n,x,y,z,t;
        sf("%I64d%I64d%I64d%I64d%I64d",&n,&x,&y,&z,&t);

        LL ans = n*x*t;

        for(i=;i<=n;i++)
          {
               for(j=;j<=i;j++)
               {
                    if(j==)
                         dp[i][j] = dp[i-][j]+(i-)*y*t;
                    else
                         dp[i][j] = max(dp[i-][j]+(i-j-)*y*(t+z*j),
                                        dp[i-][j-]+(i-j)*y*(t+z*(j-)));
                    ans = max(ans,dp[i][j]+(n-i)*(x+y*(i-j))*(t+z*j));
               }
          }
          pf("Case #%d: %I64d\n",++kase,ans);

     }
}