杂项二
来源:互联网 发布:金庸群侠传mac版 编辑:程序博客网 时间:2024/05/18 13:04
#include<iostream>
using namespace std;
int MaxLen(int arr[],int k ,int length){
int left=0;
int right=0;
int sum=arr[0];
int res=0;
while(right<=length){
if(sum==k){
if(res<(right-left+1)){
res=(right-left+1);
};
sum-=arr[left++];
}
else if(sum<k){
right++;
if(right==length) break;
sum+=arr[right];
}
else{
left++;
sum-=arr[left];
}
}
return res;
}
int main(){
int a[]={6,1,2,3,4,5,6,7,8,9};
int re=MaxLen(a,6,10);
cout<<re<<endl;
}
using namespace std;
int MaxLen(int arr[],int k ,int length){
int left=0;
int right=0;
int sum=arr[0];
int res=0;
while(right<=length){
if(sum==k){
if(res<(right-left+1)){
res=(right-left+1);
};
sum-=arr[left++];
}
else if(sum<k){
right++;
if(right==length) break;
sum+=arr[right];
}
else{
left++;
sum-=arr[left];
}
}
return res;
}
int main(){
int a[]={6,1,2,3,4,5,6,7,8,9};
int re=MaxLen(a,6,10);
cout<<re<<endl;
}