题意:有n个选手参加比赛,比赛有3个题目,每个选手每个题目都有一个评测之前的于得分,当通过题目时才可以得到相应分数,否则为0,然后按照得分排名,id小的排在前面,现在给定选手的于得分和排名,求最后一名的最大得分。
思路:贪心,要想使最后一名的成绩最大,那么只要保证前面的成绩最大即可。可以把小数化成整数。
code:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int INF=0x3fffffff;
const int inf=-INF;
const int N=1000000;
const int M=20005;
const int mod=1000000007;
const double esp=1e-4;
const double pi=acos(-1.0);
#define cls(x,c) memset(x,c,sizeof(x))
#define cpy(x,a) memcpy(x,a,sizeof(a))
#define fr(i,s,n) for (int i=s;i<=n;i++)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define middle int m=(r+l)>>1
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define mk make_pair
#define IN freopen("in.txt","r",stdin);
#define OUT freopen("out.txt","w",stdout);
double v[M][8];
int main()
{
int ca=1,n;
while (~scanf("%d",&n)&&n)
{
double a,b,c;
fr(i,1,n)
{
scanf("%lf %lf %lf",&a,&b,&c);
a=(int)((a+esp)*100),b=(int)((b+esp)*100),c=(int)((c+esp)*100);
v[i][0]=0,v[i][1]=a,v[i][2]=b,v[i][3]=c,v[i][4]=a+b;
v[i][5]=a+c,v[i][6]=b+c,v[i][7]=a+b+c;
sort(v[i],v[i]+8);
}
int la,ne,ok=1;
scanf("%d",&la);
double t=v[la][7];
fr(i,2,n)
{
scanf("%d",&ne);
if (ne>la){
for (int j=7;j>=0;j--) if (t>=v[ne][j]) {t=v[ne][j];break;}}
else
{
int tt=0;
for (int j=7;j>=0;j--) if (t>v[ne][j]) {t=v[ne][j];tt=1;break;}
if (!tt) ok=0;
}
la=ne;
}
printf("Case %d: ",ca++);
if (ok) printf("%.2lf\n",0.01*t);
else puts("No solution");
}
}