题目链接:点击打开链接
题目大意:给你一个n位的不上升数组,这个数组现在只有m位数字是可以确定的,问前两位除以总和的最小值。
解题思路:贪心,让前两位尽可能的大,后面尽可能的小,注意不上升的约束条件就好了,本质上还是一道水题。
代码:
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<ctime>
#include "cstdio"
#include "string"
#include "string.h"
#include "map"
using namespace std;
int gcd(int a, int b)
{
return (b>0) ? gcd(b, a%b) : a;
}
int a[101];
int main()
{
int T,m,n;
scanf("%d", &T);
while (T--)
{
memset(a, -1, sizeof(a));
scanf("%d %d", &n, &m);
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] = min(100,a[1]);
int sum = a[1] + a[2];
int now = 0;
for (int i = n;i >= 3;i--)
{
if (a[i] == -1)
a[i] = now;
else
now = a[i];
sum += a[i];
}
int fenzi = a[1] + a[2];
if (fenzi == 0)
{
puts("0/1");
continue;
}
int temp = gcd(fenzi, sum);
printf("%d/%d\n", fenzi / temp, sum / temp);
}
return 0;
}
a1+a2∑ni=1ai a1+a2∑ni=1ai a1+a2∑ni=1ai a1+a2∑ni=1ai