HDU5742 It's All In The Mind

题目链接：HDU5742

It's All In The Mind

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 856    Accepted Submission(s): 400

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 

 

Recommend

wange2014

 

题意：一组序列，要求后项比前项小。问那个式子的最大值。

题目分析：显然a1a2在整体的比重要尽可能的大，这样得出，a1a2取可取范围的最大值，其余的数取最小值。遍历一遍就好了。

//
//  main.cpp
//  It's All In The Mind
//
//  Created by teddywang on 2016/7/23.
//  Copyright © 2016年 teddywang. All rights reserved.
//

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int ans1,ans2;
int T,m,n;
int a[105];

int gcd(int a,int b)
{
    return a%b==0?b:gcd(b,a%b);
}

int main()
{
    cin>>T;
    while(T--)
    {
        cin>>n>>m;
        ans1=ans2=0;
        memset(a,0,sizeof(a));
        for(int i=0;i<m;i++)
        {
            int b1,b2;
            cin>>b1>>b2;
            a[b1]=b2;
        }
        if(a[1]==0) a[1]=100;
        if(a[1]==0&&a[2]==0) a[2]=100;
        else if(a[1]!=0&&a[2]==0) a[2]=a[1];
        int buf=0;
        ans1+=a[1]+a[2];
        ans2=ans1;
        for(int i=n;i>=3;i--)
        {
            if(a[i]==0)
            {
                ans2+=buf;
            }
            else
            {
                ans2+=a[i];
                buf=a[i];
            }
        }
        int d=gcd(ans2,ans1);
        printf("%d/%d\n",ans1/d,ans2/d);
    }
}