CF145E Lucky Queries

【CF145E Lucky Queries】的更多相关文章

CF145E Lucky Queries 英文题面不放了,直接上翻译: 题目描述给你n个数,每个数是4或者7,给你m个任务完成 switch l r 把[l,r]位置的4换成7,7换成4 count 计算n个数的最长不下降子序列的长度 N个数的不下降子序列是这n个数移除掉0个或者若干个位置的数,并且满足从第2个数开始每一个数不小于前一个数的大小. 输入格式第一行n,m 第二行n个数字接下来m行每行一个命令输出格式对于每一个count的命令,输出n个数的最长不下降子序的长度输入输出样例…

数据结构（线段树）：CodeForces 145E Lucky Queries

E. Lucky Queries time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains…

Codeforces 145E Lucky Queries 线段树

Lucky Queries 感觉是很简单的区间合并, 但是好像我写的比较麻烦. #include<bits/stdc++.h> #define LL long long #define fi first #define se second #define mk make_pair #define PLL pair<LL, LL> #define PLI pair<LL, int> #define PII pair<int, int> #define SZ(x…

Codeforces Round #104 (Div. 1)

A.Lucky Conversion 题意给定两个长度为 \(N(N \le 10^5)\) 且由4和7构成的 \(a, b\)串对 \(a\) 可以有两种操作: 交换两个位置的字符; 改变一个位置的字符. 求最少到操作次数,使得两串相同. 思路统计需要改变4的个数和改变7的个数. 两个数到最小值表示两两交换使得对应位相同,剩下的只有其中一种,再进行操作2使得对应位相同. 也就是取两者最大值即答案. B. Lucky Number 2 题意用 \(cnt(x)\) 表示串 \(x\) 在…

SPOJ 1557. Can you answer these queries II 线段树

Can you answer these queries II Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 https://www.spoj.com/problems/GSS2/ Description Being a completist and a simplist, kid Yang Zhe cannot solve but get Wrong Answer from most of the OI problems. And he refuse…

spoj gss2 : Can you answer these queries II 离线&&线段树

1557. Can you answer these queries II Problem code: GSS2 Being a completist and a simplist, kid Yang Zhe cannot solve but get Wrong Answer from most of the OI problems. And he refuse to write two program of same kind at all. So he always failes in co…

SPOJ GSS2 - Can you answer these queries II（线段树区间修改+区间查询）（后缀和）

GSS2 - Can you answer these queries II #tree Being a completist and a simplist, kid Yang Zhe cannot solve but get Wrong Answer from most of the OI problems. And he refuse to write two program of same kind at all. So he always failes in contests. When…