A. Valera and Plates
l链接:http://codeforces.com/contest/369/problem/A
描述:Valera有m个碗和k个盘子,有n天,每天只吃一顿饭。每天有两种类型的dish可以选择,第一种只能用碗,第二种可以用碗或者盘子。不够用的情况吃饭前提前洗,求最优的安排下最少洗多少次。
思路:水题,有点贪心思想。
//GNU C++ 4.7
#include <iostream>
#include <cstdio>
int main()
{
int n, m, k;
while (scanf("%d %d %d", &n, &m, &k) != EOF) {
int a[n];
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
for (int i = 0; i < n; ++i) {
if (a[i] == 1)
--m;
if (a[i] == 2) {
if (k > 0)
--k;
else
--m;
}
}
printf("%d\n", m < 0 ? -m : 0);
}
return 0;
}
B. Valera and Contest
链接:http://codeforces.com/contest/369/problem/B
描述:有一个非减序列有n个元素每个元素都在【l,r】之间,告诉你前k个和为sk总和为sn让你输出一种序列的可能的结果。
思路:还是贪心。
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
int main()
{
int n, k, l, r, sall, sk;
while (scanf("%d %d %d %d %d %d", &n, &k, &l, &r, &sall, &sk) != EOF)
{
const int t1 = sk / k, t2 = sk % k;
for (int i = 0; i < t2; ++i)
printf("%d ", t1 + 1);
for (int i = 0; i < k - t2; ++i)
printf("%d ", t1);
if (n == k) //注意n==k的情况,否则下面会除以0
continue;
int t3 = (sall - sk) / (n - k), t4 = (sall - sk) % (n - k);
for (int i = 0; i < t4; ++i)
printf("%d ", t3 + 1);
for (int i = 0; i < n - k - t4; ++i)
printf("%d ", t3);
printf("\n");
}
return 0;
}