hdu 5742 It's All In The Mind

Problem Description
Professor Zhang has a number sequence a1,a2,…,an. However, the sequence is not complete and some elements are missing. Fortunately, Professor Zhang remembers some properties of the sequence:

1. For every i∈{1,2,…,n}, 0≤ai≤100.
2. The sequence is non-increasing, i.e. a1≥a2≥…≥an.
3. The sum of all elements in the sequence is not zero.

Professor Zhang wants to know the maximum value of a1+a2∑ni=1ai among all the possible sequences.

Input
There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:

The first contains two integers n and m (2≤n≤100,0≤m≤n) – the length of the sequence and the number of known elements.

In the next m lines, each contains two integers xi and yi (1≤xi≤n,0≤yi≤100,xi

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
    int t,n,m,i,j,x[105],y[105],a[105];
    scanf("%d",&t);
    while(t--)
    {
        memset(a,0,sizeof(a));
        scanf("%d%d",&n,&m);
        for(i=1; i<=m; i++)
        {
            scanf("%d%d",&x[i],&y[i]);
        }
        if(m==0)//如果m为0的话，一直为1/1
        {
            printf("1/1\n");
        }
        else
        {
            int x1=0,sum=0;
            int x2;
            for(i=1; i<=m; i++)
            {
                a[x[i]]=y[i];
            }
            //分了四种情况计算a[1]+a[2]的和,
            if(a[1]==0&&a[2]==0)
            {
                x2=200;
            }
            else if(a[1]>0&&a[2]==0)
            {
                x2=a[1]+a[1];
            }
            else if(a[1]==0&&a[2]>0)
            {
                x2=100+a[2];
            }
            else if(a[1]>0&&a[2]>0)
            {
                x2=a[1]+a[2];
            }
            x1=n;
            if(n==2)
                sum=0;
            else
                sum+=a[n];
            for(i=n-1; i>2; i--)
            {
                if(a[i]>=a[x1])
                {
                    sum+=a[i];
                    x1=i;
                }
                else
                {
                    sum+=a[x1];
                    a[i]=a[x1];
                }
            }
            int y2=x2+sum;
            //最后还要求约分
            int p=x2,q=y2,v;
            while(y2!=0)
            {
                v=x2%y2;
                x2=y2;
                y2=v;
            }
            printf("%d/%d\n",p/x2,q/x2);
        }
    }
    return 0;
}