package org.example.od1;
import java.util.Scanner;
/*
【判断一组不等式是否满足约束并输出最大差】给定一组不等式,判断是否成立并输出不等式的最大差(输出浮点数的整数部分),要求:1)不等式系数为double类 型,
是一个二维数组;2)不等式的变量为int类型,是一维数组;3)不等式的目标值为double类型,是一维数组;4)不等式约束为字符串数组,只能
是:">",">=","<","<=","=",例如,不等式组:
a11*x1+a12*x2+a13*x3+a14*x4+a15*x5<=b1;
a21*x1+a22*x2+a23*x3+a24*x4+a25*x5<=b2;
a31*x1+a32*x2+a33*x3+a34*x4+a35*x5<=b3;
最大差=max{ (a11*x1+a12*x2+a13*x3+a14*x4+a15*x5-b1), (a21*x1+a22*x2+a23*x3+a24*x4+a25*x5-b2),
(a31*x1+a32*x2+a33*x3+a34*x4+a35*x5-b3) },类型为整数(输出浮点数的整数部分)
输入描述:
1) 不等式组系数(double类型):
a11,a12,a13,a14,a15
a21,a22,a23,a24,a25
a31,a32,a33,a34,a35
2) 不等式变量(int类型):
x1,x2,x3,x4,x5
3) 不等式目标值(double类型):b1,b2,b3
4) 不等式约束(字符串类型):<=,<=,<=
输入:
a11,a12,a13,a14,a15;
a21,a22,a23,a24,a25;
a31,a32,a33,a34,a35;
x1,x2,x3,x4,x5;
b1,b2,b3;
<=,<=,<=
思路:
直接解题
*/
public class od1_2 {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
String[] split = s.split(";");
int m=split.length-3;//不等式个数
int n=split[0].split(",").length;//二维数组的长度
//创建标准输入输出
//创建不等式组系数
double[][] a=new double[m][n];
int count=0;
//系数数组初始化
for (int i = 0; i < m; i++) {
String[] s1=split[i].split(",");//拆分字符串
for(int j=0;j<n;j++){
a[i][j]=Double.valueOf(s1[j]);
}
}
//创建不等式变量
int[] x=new int[n];
String[] s1=split[split.length-3].split(",");//拆分字符串
for(int j=0;j<n;j++){
x[j]=Integer.valueOf(s1[j]);
}
//创建不等式目标值
double[] b=new double[m];
String[] s2=split[split.length-2].split(",");//拆分字符串
for(int j=0;j<m;j++){
b[j]=Double.valueOf(s2[j]);
}
//创建约束条件
String[] t=new String[m];
String[] s3=split[split.length-1].split(",");//拆分字符串
for(int j=0;j<m;j++){
t[j]=s3[j];
}
double[] sub=new double[m];
//判定条件
//a11*x1+a12*x2+a13*x3+a14*x4+a15*x5<=b1;
//a21*x1+a22*x2+a23*x3+a24*x4+a25*x5<=b2;
//a31*x1+a32*x2+a33*x3+a34*x4+a35*x5<=b3;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
sub[i]=sub[i]+a[i][j]*x[j];
}
}
//判断不等式是不是合法
boolean f=isElago(t,sub,b);
//合法直接输出true
if (f){
System.out.println(f);
}else {
int maxt=maxSub(sub,b);
System.out.println(f+" "+maxt);
}
}
private static int maxSub(double[] sub, double[] b) {
double max= (sub[0]-b[0]);
for (int i = 0; i < sub.length; i++) {
if (sub[i]-b[i]>max){
max= sub[i]-b[i];
}
}
return (int)max;
}
//条件判断
private static boolean isElago(String[] t, double[] sub,double[] b) { //条件判断
for (int i = 0; i < sub.length; i++) {
if("==".equals(t[i])){
if (sub[i]!=b[i]){
return false;
}
}
else if("<".equals(t[i])){
if (sub[i]>=b[i]){
return false;
}
} else if(">".equals(t[i])){
if (sub[i]<=b[i]){
return false;
}
}else if("<=".equals(t[i])){
if (sub[i]>b[i]){
return false;
}
}else if(">=".equals(t[i])){
if (sub[i]<b[i]){
return false;
}
}
}
return true;
}
}
刷题2:判断一组不等式是否满足约束并输出最大差
最新推荐文章于 2023-08-04 00:00:36 发布