mirror of
https://gitcode.com/Zengtudor/alg2025.git
synced 2025-08-21 18:52:07 +00:00
添加 T633667s1.cpp 文件,实现算法并优化输入输出性能
This commit is contained in:
parent
e471e87897
commit
3d8c15bd7f
40
src/7/24/T633667s1.cpp
Normal file
40
src/7/24/T633667s1.cpp
Normal file
@ -0,0 +1,40 @@
|
|||||||
|
#include <algorithm>
|
||||||
|
#include <cstdint>
|
||||||
|
#include <iostream>
|
||||||
|
#include <istream>
|
||||||
|
#include <limits>
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
using ll = int64_t;
|
||||||
|
|
||||||
|
double ans=0.0;
|
||||||
|
ll m,n;
|
||||||
|
std::vector<ll> v;
|
||||||
|
|
||||||
|
int main(){
|
||||||
|
std::iostream::sync_with_stdio(false);
|
||||||
|
std::cin.tie(nullptr);
|
||||||
|
std::cout.tie(nullptr);
|
||||||
|
std::cin>>m>>n;
|
||||||
|
v.resize(n+1);
|
||||||
|
for(ll i=1;i<=m;i++){
|
||||||
|
v.assign(n+1,0);
|
||||||
|
for(ll j=1;j<=n;j++){
|
||||||
|
std::cin>>v[j];
|
||||||
|
v[j]+=v[j-1];
|
||||||
|
}
|
||||||
|
double nans=std::numeric_limits<double>::max();
|
||||||
|
for(ll j=2;j<v.size()-1;j++){
|
||||||
|
for(ll k=j;k<v.size()-1;k++){
|
||||||
|
ll len=n-(k-j+1);
|
||||||
|
ll sum=v[n]-(v[k]-v[j-1]);
|
||||||
|
nans=std::min(
|
||||||
|
nans,
|
||||||
|
double(sum)/double(len)
|
||||||
|
);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
ans+=nans;
|
||||||
|
}
|
||||||
|
std::cout<<ans<<'\n';
|
||||||
|
}
|
3
src/7/25/T639173.cpp
Normal file
3
src/7/25/T639173.cpp
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
int main(){
|
||||||
|
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user