Codeforces Pictures with Kittens (easy version) DP

探讨了在社交网络中,如何从一系列连续的猫咪图片中选择特定数量的图片进行分享,以确保每段至少k张连续图片中至少有一张被选中,同时使所选图片的总美观度最大化的问题。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

F1. Pictures with Kittens (easy version)

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The only difference between easy and hard versions is the constraints.

Vova likes pictures with kittens. The news feed in the social network he uses can be represented as an array of nn consecutive pictures (with kittens, of course). Vova likes all these pictures, but some are more beautiful than the others: the ii-th picture has beauty aiai.

Vova wants to repost exactly xx pictures in such a way that:

  • each segment of the news feed of at least kk consecutive pictures has at least one picture reposted by Vova;
  • the sum of beauty values of reposted pictures is maximum possible.

For example, if k=1k=1 then Vova has to repost all the pictures in the news feed. If k=2k=2 then Vova can skip some pictures, but between every pair of consecutive pictures Vova has to repost at least one of them.

Your task is to calculate the maximum possible sum of values of reposted pictures if Vova follows conditions described above, or say that there is no way to satisfy all conditions.

Input

The first line of the input contains three integers n,kn,k and xx (1≤k,x≤n≤2001≤k,x≤n≤200) — the number of pictures in the news feed, the minimum length of segment with at least one repost in it and the number of pictures Vova is ready to repost.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109), where aiai is the beauty of the ii-th picture.

Output

Print -1 if there is no way to repost some pictures to satisfy all the conditions in the problem statement.

Otherwise print one integer — the maximum sum of values of reposted pictures if Vova follows conditions described in the problem statement.

Examples

input

Copy

5 2 3
5 1 3 10 1

output

Copy

18

input

Copy

6 1 5
10 30 30 70 10 10

output

Copy

-1

input

Copy

4 3 1
1 100 1 1

output

Copy

100

题目链接:http://codeforces.com/problemset/problem/1077/F1

题目大意:满足任意连续的k个数至少有一个选中,问选中x个的最大值,如果不存在输出-1,否则输出最大值

#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef pair < ll, ll > P ;
const ll Maxn = 5e3 + 10 ;
const ll INF = 0x3f3f3f3f ;

ll dp[Maxn][Maxn] ;
ll a[Maxn] ;
ll n, k, x ;
priority_queue < P > que ;

int main (){
    cin >> n >> k >> x ;
    for (ll i = 1; i <= n; i++) cin >> a[i] ;
    n++ ;
    x++ ;
    for (ll i = 0; i <= x; i++){
        for (ll j = 0 ;j <= n; j++){
            dp[i][j] = -INF ;
        }
    }
    dp[0][0] = 0 ;
    for (ll i = 1; i <= x; i++){
        for (ll j = i; j <= n; j++){
//            cout << j - 1 + k << endl ;
            que.push(make_pair(dp[i - 1][j - 1], j - 1 + k)) ;
//            cout << dp[i - 1][j - 1] << " " << j - 1 + k << endl ;
            while (que.top().second < j) que.pop() ;
            if (que.top().first < 0) break ;
            dp[i][j] = que.top().first + a[j] ;
        }
        while (!que.empty()) que.pop() ;
    }
    dp[x][n] = max(-1ll, dp[x][n]) ;
    cout << dp[x][n] << endl ;
    return 0 ;
}

F2. Pictures with Kittens (hard version)

链接:https://codeforces.com/problemset/problem/1077/F2

对于增强版也是可以实用的。

内容概要:本文详细探讨了基于MATLAB/SIMULINK的多载波无线通信系统仿真及性能分析,重点研究了以OFDM为代表的多载波技术。文章首先介绍了OFDM的基本原理和系统组成,随后通过仿真平台分析了不同调制方式的抗干扰性能、信道估计算法对系统性能的影响以及同步技术的实现与分析。文中提供了详细的MATLAB代码实现,涵盖OFDM系统的基本仿真、信道估计算法比较、同步算法实现和不同调制方式的性能比较。此外,还讨论了信道特征、OFDM关键技术、信道估计、同步技术和系统级仿真架构,并提出了未来的改进方向,如深度学习增强、混合波形设计和硬件加速方案。; 适合人群:具备无线通信基础知识,尤其是对OFDM技术有一定了解的研究人员和技术人员;从事无线通信系统设计与开发的工程师;高校通信工程专业的高年级本科生和研究生。; 使用场景及目标:①理解OFDM系统的工作原理及其在多径信道环境下的性能表现;②掌握MATLAB/SIMULINK在无线通信系统仿真中的应用;③评估不同调制方式、信道估计算法和同步算法的优劣;④为实际OFDM系统的设计和优化提供理论依据和技术支持。; 其他说明:本文不仅提供了详细的理论分析,还附带了大量的MATLAB代码示例,便于读者动手实践。建议读者在学习过程中结合代码进行调试和实验,以加深对OFDM技术的理解。此外,文中还涉及了一些最新的研究方向和技术趋势,如AI增强和毫米波通信,为读者提供了更广阔的视野。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值