a=list(map(int,input().split()))
print(len(a),max(a),end=" ")

a = list(map(int, input().split())) 
b = len(a) 
c = a[0] 
for i in a: 
    if i > c: 
        c = i 
print(b, c)

#include #include using namespace std; int a[1010]; int m,maxt; int main() { cin>>a[1]; maxt=a[1]; int k=2; while(cin>>a[k]){ if(a[k]>maxt)maxt=a[k]; k+=1;

}

cout<<k-1<<" "<<maxt<<endl;
return 0;

}

#include #include using namespace std; int a[1010]; int m,maxt; int main() { cin>>a[1]; maxt=a[1]; int k=2; while (cin>>a[k]){ if(a[k]>maxt) maxt=a[k]; k+=1; } cout <<k-1<<" "<<maxt<<endl; return 0; } Copy

#include

#include

using namespace std;

const int Maxn=10010;

int a[Maxn];

int n, maxt;

int main()

{

cin>>a[1];

maxt=a[1];

n=2;

while(cin>>a[n]){

    if(maxt<a[n]){

        maxt=a[n];

    }

    n+=1;


}

cout<<n-1<<" "<<maxt<<endl;

return 0;

}

#include #include using namespace std; int a[1010]; int m,maxt; int main() { cin>>a[1]; maxt=a[1]; int k=2; while (cin>>a[k]){ if(a[k]>maxt) maxt=a[k]; k+=1; } cout <<k-1<<" "<<maxt<<endl; return 0; }

#include <bits/stdc++.h> using namespace std; int a[150]; int main() { long long n=0,max=-10000000; while(scanf("%d",&a[n])==1){ n++; } for(int i=0;i<n;i++){ if(a[i]>max) max=a[i]; } cout<<n<<" "<<max; return 0; }

怎么没人发啊 numbers = list(map(int, input().split())) count = len(numbers) max_num = numbers[0] for num in numbers: if num > max_num: max_num = num print(count, max_num)

反三 #include using namespace std;

int main() { long n; cin >> n; long a[10001]; for (int i = 1; i <= n; i++) { cin >> a[i]; } long max = a[1]; for (int i = 2; i <= n; i++) { if (a[i] > max) { max = a[i]; } } cout << max << endl; return 0; }

彩笔管敏皓 #include <bits/stdc++.h>

using namespace std;

int main() { int n = 0, m, mx = -999999;

while (scanf("%d", &m) == 1){
    n += 1;
    if (m > mx)
        mx = m;
}

cout << n << " " << mx;

return 0;

}

#include <bits/stdc++.h>

using namespace std;

int a[150];

int main()

{

long long n=0,max=-10000000;

while(scanf("%d",&a[n])==1){

    n++;

}

for(int i=0;i<n;i++){

    if(a[i]>max) max=a[i];

}

cout<<n<<" "<<max;

return 0;

}