poj 3061 Subsequence 简单题。。可以用二分也可用尺取
2013-11-26 18:19
337 查看
二分代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdlib>
#include<map>
#include<set>
#include<vector>
using namespace std;
int kep[10000005];
int sum[10000005];
int main()
{
int n,t,s;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&s);
int ans=n;
for(int i=0;i<n;i++)
{
scanf("%d",&kep[i]);
}
for(int i=0;i<n;i++)
sum[i+1]=sum[i]+kep[i];
if(sum
<s)
{
printf("0\n");
continue;
}
for(int i=0;sum[i]+s<=sum
;i++)
{
int t=lower_bound(sum+i,sum+n,sum[i]+s)-sum;
ans=min(ans,t-i);
}
printf("%d\n",ans);
}
// system("pause");
return 0;
}
尺取法代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdlib>
#include<map>
#include<set>
#include<vector>
using namespace std;
int kep[1000005];
int min(int a,int b)
{
return a<b?a:b;
}
int main()
{
int n,t,s;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&s);
for(int i=0;i<n;i++)
scanf("%d",&kep[i]);
int t=0,e=0,sum=0,ans=n+1;
while(e<=n)
{
while(sum<s)
{
sum+=kep[e];
e++;
if(e>n)
break;
}
ans=min(ans,e-t);
sum-=kep[t];
t++;
}
if(ans>n)
ans=0;
printf("%d\n",ans);
}
// system("pause");
return 0;
}
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdlib>
#include<map>
#include<set>
#include<vector>
using namespace std;
int kep[10000005];
int sum[10000005];
int main()
{
int n,t,s;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&s);
int ans=n;
for(int i=0;i<n;i++)
{
scanf("%d",&kep[i]);
}
for(int i=0;i<n;i++)
sum[i+1]=sum[i]+kep[i];
if(sum
<s)
{
printf("0\n");
continue;
}
for(int i=0;sum[i]+s<=sum
;i++)
{
int t=lower_bound(sum+i,sum+n,sum[i]+s)-sum;
ans=min(ans,t-i);
}
printf("%d\n",ans);
}
// system("pause");
return 0;
}
尺取法代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdlib>
#include<map>
#include<set>
#include<vector>
using namespace std;
int kep[1000005];
int min(int a,int b)
{
return a<b?a:b;
}
int main()
{
int n,t,s;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&s);
for(int i=0;i<n;i++)
scanf("%d",&kep[i]);
int t=0,e=0,sum=0,ans=n+1;
while(e<=n)
{
while(sum<s)
{
sum+=kep[e];
e++;
if(e>n)
break;
}
ans=min(ans,e-t);
sum-=kep[t];
t++;
}
if(ans>n)
ans=0;
printf("%d\n",ans);
}
// system("pause");
return 0;
}
相关文章推荐
- poj 3061 Subsequence【简单尺取】
- poj 3061 Subsequence 尺取
- POJ 3061 Subsequence(尺取法)
- POJ 3061 Subsequence
- POJ 3061 Subsequence
- poj 3061 Subsequence
- [ACM] POJ 3061 Subsequence (尺取法)
- POJ 3061 简单二分
- Subsequence (二分)【POJ】-3061
- [POJ 3061]Subsequence
- poj 3061 Subsequence
- 如果你没有可用分.可是有PHP方面简单问题.可以直接留言给我,我会尽量的回答。
- poj 3061 Subsequence -尺取法
- poj-3061-Subsequence & 尺取法
- poj 3061 Subsequence
- POJ 3061 Subsequence
- POJ 3061 Subsequence(尺取法)
- POJ2533——Longest Ordered Subsequence(简单的DP)
- poj 3061 Subsequence(尺取法)
- POJ:3061 Subsequence