hdu5742 It's All In The Mind（水）

思路：保证a1+a2最大，然后后面的小就可以了

#include<bits/stdc++.h>
using namespace std;
const int maxn = 200;
int a[maxn];
int gcd(int a,int b)
{
	if(b==0)
		return a;
	return gcd(b,a%b);
}
int main()
{
    int T;
	scanf("%d",&T);
	while(T--)
	{
		int n,m;
		scanf("%d%d",&n,&m);
        memset(a,0,sizeof(a));
		for(int i = 1;i<=m;i++)
		{
			int x,y;
			scanf("%d%d",&x,&y);
			a[x]=y;
		}
		a[n+1]=0;
		for(int i = n;i>=3;i--)
			if(a[i]==0)
				a[i] = a[i+1];
		a[0]=100;
		for(int i = 1;i<=2;i++)
			if(a[i]==0)
				a[i]=a[i-1];
		int ans = 0;
		for(int i = 1;i<=n;i++)
			ans+=a[i];
        int res = a[1]+a[2];
		int gg = gcd(ans,res);
        ans/=gg;
		res/=gg;
		printf("%d/%d\n",res,ans);
	}
}

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<xi+1,yi≥yi+1) , indicating that  axi=yi .

 

Output

For each test case, output the answer as an irreducible fraction " p / q ", where  p ,  q  are integers,  q>0 .

 

Sample Input

  
  

   
   2
2 0
3 1
3 1
  
  

 

Sample Output

  
  

   
   1/1
200/201
  
  

 

Author

zimpha

 

Source

2016 Multi-University Training Contest 2