Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 14927 | Accepted: 6312 |
Description
Input
Output
Sample Input
2
10 15
5 1 3 5 10 7 4 9 2 8
5 11
1 2 3 4 5
Sample Output
2
3
Source
![](http://m.sbmmt.com/img/upload/article/000/000/001/6b0afd34b84e150acff70cd4afeab359-0.png)
代码
import java.util.Scanner; public class Main{ /** * @param args */ static int n,s; static int map[]=new int[100000+3]; static int sum[]=new int[100000+3]; public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan=new Scanner(System.in); int t=scan.nextInt(); while(t>0){ n=scan.nextInt(); s=scan.nextInt(); for(int i=0;i<n;i++){ map[i]=scan.nextInt(); } sovle(); t--; } } private static void sovle() { // TODO Auto-generated method stub int res=n+1; int ss=0,t=0,sum=0; for(;;){ while(t<n&&sum<s){ sum+=map[t++]; } if(sum<s){ break; } res=Math.min(res, t-ss); sum-=map[ss++]; } if(res>n){ res=0; } System.out.println(res); } }
以上就是poj3061(尺取法)的详细内容,更多请关注php中文网其它相关文章!