Submission #147593

#	Time	Username	Problem	Language	Result	Execution time	Memory
147593		SeekingOblivion	Telefoni (COCI17_telefoni)	C++14	80 / 80	82 ms	2680 KiB

telefoni

//#include<fstream>
#include<algorithm>
#include<iostream>
#define fin cin
#define fout cout
using namespace std;
//ifstream fin("date.in");
//ofstream fout("date.out");
int i,n,d;
int v[300010],s[300010];
int main()
{
    fin>>n>>d;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];v[i]+=v[i-1];
        if(i!=1&&v[i-1]-v[max(i-d,1)-1]==0)
            s[i]=s[max(i-d,1)]+1;
        else
            s[i]=s[i-1];
    }
    fout<<s[n];
    return 0;
}

• Subtask 1: 80 / 80