O(n2)解法WA
查看原帖
O(n2)解法WA
930075
MDTSF楼主2023/3/24 21:03
#include<bits/stdc++.h>
using namespace std;

int n,m,a[3200+5],l,minn=INT_MAX;

int main(){
	cin>>n>>m;
	for (int i=0;i<n;++i)scanf("%d",&a[i]);
	
	for (int l=0;l<n-m;++l){
		int cnt=0;
		for (int i=l;i<=l+m;++i)cnt+=a[i];
		minn=min(cnt,minn); 
		cout<<cnt<<endl;
	}
	cout<<minn;
	return 0;
}
2023/3/24 21:03
加载中...