2016 Multi-University Training Contest 2 1009 It's All In The Mind

最新推荐文章于 2020-10-14 14:22:32 发布

原创最新推荐文章于 2020-10-14 14:22:32 发布 · 462 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#2016 Multi-Universit #ACM #hdu #多校联合训练

多校联合训练专栏收录该内容

42 篇文章

订阅专栏

本文针对HDU OJ编号5742的问题进行了解析，该问题是关于寻找满足特定条件的数列，使得由数列构成的特定分数最大化。文章通过设定数列的属性和已知元素，采用合理的填充策略来解决此问题。

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5742

题目：

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

(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

(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 "

q", where

q are integers,

q>0.

Sample Input

Sample Output

1/1
200/201

前两个数尽可能大，后面的数尽可能小，乱搞一下即可。

#include <iostream>
#include<cstdio>
#include<cmath>
#include<cstring>

using namespace std;

int gcd(int x,int y)
{
    return y==0?x:gcd(y,x%y);
}
int a[110];

int main()
{
    int T,n,m;
    cin>>T;
    while(T--)
    {
        scanf("%d%d",&n,&m);
        memset(a,-1,sizeof(a));
        for(int i=0;i<m;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            a[x]=y;
        }
        if(a[1]==-1)
        {
            a[1]=100;
            if(a[2]==-1)    a[2]=100;
        }
        else    if(a[2]==-1)    a[2]=a[1];
        int t=0;
        for(int i=n;i>2;i--)
        {
            if(a[i]<t)  a[i]=t;
            else    t=a[i];
        }
        int x=a[1]+a[2],y=0;
        for(int i=1;i<=n;i++)   y+=a[i];
        int c=gcd(x,y);
        printf("%d/%d\n",x/c,y/c);
    }
}