目录 题目 口胡题解 题目 有许多的青蛙要过河,可惜的是,青蛙根本跳不过河,他们最远只能跳 \(L\) 单位长度,而河宽 \(W\) 单位长度. 在河面上有一些石头,距离 \(i\) 远的地方有 \(a_i\) 个石头,每个石头只能使用一次,求最大能有多少青蛙过河. 输入的第一行为两个整数 \(W,L(1<l<w<10^5)\) 第二行有 \(W-1\) 个整数 \(a_1,a_2.......a_{w-1}(0<a_i<10^4)\) 输出为一个整数,即能过河的最大青蛙数…

ref #include <iostream> #include <cstdio> using namespace std; int a[100005], n, l, ans=0x3f3f3f3f; int main(){ cin>>n>>l; for(int i=1; i<n; i++){ scanf("%d", &a[i]); a[i] += a[i-1]; } for(int i=l; i<n; i++) ans…

Code: #include<cstdio> #include<algorithm> using namespace std; const int maxn = 1000000 + 3; long long arr[maxn], ans[maxn], sumv[maxn]; int main() { int T = 1; while(T--){ int w, l; scanf("%d%d",&w,&l); for(int i = 1;i <…

Soma is a fashionable girl. She absolutely loves shiny stones that she can put on as jewellery accessories. She has been collecting stones since her childhood - now she has become really good with identifying which ones are fake and which ones are no…

Colored stones Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1759 Accepted: 829 Description You are given a row of m stones each of which has one of k different colors. What is the minimum number of stones you must remove so that no two…

E. Game of Stones   Sam has been teaching Jon the Game of Stones to sharpen his mind and help him devise a strategy to fight the white walkers. The rules of this game are quite simple: The game starts with n piles of stones indexed from 1 to n. The i…

Problem Description: A mysterious circular arrangement of black stones and white stones has appeared. Ming has been tasked with balancing the stones so that only one black and one white stone remain. Ming has two operations for balancing the stones:…

Problem description There are n stones on the table in a row, each of them can be red, green or blue. Count the minimum number of stones to take from the table so that any two neighboring stones had different colors. Stones in a row are considered ne…

运行/sbin/shutdown now最后显示:Telling INIT to go to single user mode.INIT:Going single userINIT:Sending grocesses the TERM signalINIT:no more processes left in this runlevelsh-3.2#在此状态下运行csh后自动登录为root.若运行exit系统就重新启动回到登录画面. 登录后运行reboot,系统可正常重启.   解决方法: 1.…

Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. For example: Given nums = [1, 2, 1, 3, 2, 5], return [3, 5]. Note: The order…