P1007 独木桥 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
1.代码
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
long long l, n, a, ansi = 0, ansa = 0;
cin >> l;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a;
if (a < (l + 1) / 2)
{
ansi = max(a, ansi);
ansa = max(l - a + 1, ansa);
}
else
{
ansi = max(l - a + 1, ansi);
ansa = max(a, ansa);
}
}
cout << ansi << " " << ansa << endl;
return 0;
}
2.思路
贪心算法,士兵相遇即转身,因为士兵速度一样,所以可以相当于直接穿过去,那么最短时间就是离中间最近的人离开桥,最长时间是距离中间最远的人用最长时间离开桥,因为规定了每个士兵的坐标,所以分两种情况讨论,最后求解即可
P1223 排队接水 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
1.代码
#include<iostream>
#include<algorithm>
#include<iomanip>
using namespace std;
struct line
{
int b, num;
};
bool cmp(line x, line y)
{
return x.b < y.b;
}
int main()
{
int n;
double time = 0, sum = 0;
cin >> n;
struct line a[10010]{};
for (int i = 1; i <= n; i++)
{
cin >> a[i].b;
a[i].num = i;
}
sort(a + 1, a + n + 1, cmp);
for (int i = 1; i <= n; i++)
{
cout << a[i].num << " ";
}
cout << endl;
for (int m = 2; m <= n; m++)
{
time += a[m - 1].b;
sum += time;
}
cout << fixed << setprecision(2) << sum / n;
}
2.思路
从大到小排序,用一些结构体知识,简简单单
P1803 凌乱的yyy / 线段覆盖 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
1.代码
#include<iostream>
#include <algorithm>
using namespace std;
struct comp
{
int b, c;
};
bool cmp(comp x, comp y)
{
return x.c < y.c;
}
int main()
{
int n, num = 1;
struct comp a[1000010];
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i].b >> a[i].c;
}
sort(a + 1, a + n + 1, cmp);
int d = a[1].c;
for (int m = 1; m <= n; m++)
{
if (a[m].b >= d)
{
num++;
d = a[m].c;
}
}
cout << num;
return 0;
}
2.思路
贪心算法,先从小到大排序结束时间,只要参加比赛的开始时间大于或等于上一场比赛的结束时间,就num++,值得注意的是num=1为初始条件
P1031 [NOIP2002 提高组] 均分纸牌 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
1.代码
#include<iostream>
using namespace std;
int main()
{
int n,sum=0,average=0,num=0; int a[10000];
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
sum += a[i];
}
average = sum / n;
for (int i = 1; i <= n; i++)
{
if (a[i] ==average)
{
continue;
}
num++;
if (a[i] > average)
{
a[i + 1] += (a[i] - average);
a[i] = average;
}
if (a[i] < average)
{
a[i + 1] -= (average - a[i]);
a[i] = average;
}
}
cout << num;
return 0;
}
2.思路
贪心算法,只让牌按一个顺序从左向右移动,大于平均值将多余牌移到下一牌组,小于同样的思路