zoukankan      html  css  js  c++  java
  • hdu 5742 It's All In The Mind 水题

    It's All In The Mind

    题目连接:

    http://acm.hdu.edu.cn/showproblem.php?pid=5742

    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

    Hint

    题意

    你有n个数,现在给你规定一些数的取值。

    然后你要给其他没有赋值的数赋值,使得这个序列是单调不增的序列。

    并且(a1+a2)/sigma(a)最大,输出这个值。

    题解:

    贪心就好了,a1,a2取得越大越好,剩下的数取得越小越好。

    先左右扫一下,确定每个数的取值范围,然后再扫一遍贪心就行了。

    代码

    #include<bits/stdc++.h>
    using namespace std;
    const int maxn = 103;
    int a[maxn];
    int gcd(int aa,int bb){
        if(bb==0)return aa;
        return gcd(bb,aa%bb);
    }
    int Ma[maxn],Mi[maxn];
    void solve(){
        memset(a,-1,sizeof(a));
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i=0;i<=n+1;i++){
            Ma[i]=100;
            Mi[i]=0;
        }
        for(int i=1;i<=m;i++){
            int x,y;
            scanf("%d%d",&x,&y);
            Ma[x]=y;
            Mi[x]=y;
        }
    
        for(int i=1;i<=n;i++)
            Ma[i]=min(Ma[i],Ma[i-1]);
    
        for(int i=n;i>=1;i--)
            Mi[i]=max(Mi[i],Mi[i+1]);
    
        long long up = 0;
        long long down = 0;
    
        for(int i=1;i<=n;i++){
            if(i<=2)a[i]=Ma[i];
            else a[i]=Mi[i];
            down+=a[i];
        }
        up = a[1]+a[2];
        if(down==0)down=1;
        int g = gcd(up,down);
        printf("%I64d/%I64d
    ",up/g,down/g);
    }
    int main(){
        int t;
        scanf("%d",&t);
        while(t--)solve();
        return 0;
    }
  • 相关阅读:
    Ubuntu安装最新版的nodejs
    Mac安装并破解OmniGraffle7
    Mac安装并破解StarUML
    Windows10使用Chocolatey安装mysql之后无法使用的解决办法
    Visual Studio编辑类模板的位置
    VS2017连接到中国区的Azure
    Windows上包管理器之Chocolatey初体验
    CENTOS7.3 64位架设使用MYSQL数据库的ASP.NET CORE网站
    从无到有开发自己的Wordpress博客主题---主页模板
    c# 获得方法的所属类(或调用者)的类名,方法名
  • 原文地址:https://www.cnblogs.com/qscqesze/p/5692814.html
Copyright © 2011-2022 走看看