A.读到第i章，就有N - i + 1章还没读。

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const double eps = 1e-;

const int maxn = ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

PII a[maxn];

int main(){

    Sca(N);

    for(int i = ; i <= N ; i ++){

        Sca2(a[i].fi,a[i].se);

    }

    K = read();

    for(int i = ; i <= N ; i ++){

        if(a[i].fi <= K && K <= a[i].se){

            Pri(N - i + );

            break;

        }

    }

    return ;

}

B.很显然，先把起始点的石头扔到一边，然后向离端点距离短的一边走，走到端点再想另一端走，途中一边取硬币，石头全扔到起始点。

推出式子显然

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const double eps = 1e-;

const int maxn = ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

PII a[maxn];

int main(){

    Sca2(N,K);

    Pri( + N +  * min(N - K,K - ) + max(N - K,K - ) + N - );

    return ;

}

C.发现对2 * 2的矩阵操作就是把斜相邻的两个数交换，其余N * M的矩阵操作都可以通过交换两个斜对角实现，所以交换只能交换左上右下这样一个斜对角。

那么判断两个矩阵的每个斜对角是否是相同的元素即可

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const double eps = 1e-;

const int maxn = ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

int A[maxn][maxn],B[maxn][maxn];

vector<int>a[maxn * ],b[maxn * ];

int main(){

    Sca2(N,M);

    For(i,,N) For(j,,M) Sca(A[i][j]);

    For(i,,N) For(j,,M) Sca(B[i][j]);

    For(i,,N) For(j,,M){

        a[i + j].pb(A[i][j]);

        b[i + j].pb(B[i][j]);

    }

    for(int i = ; i <= N + M ; i ++){

        sort(a[i].begin(),a[i].end());

        sort(b[i].begin(),b[i].end());

        if(a[i] != b[i]){

            puts("NO");

            return ;

        }

    }

    puts("YES");

    return ;

}

D.前面的u点可以和后面的v点交换称为u可以吃掉v，点i最终可以排到nastya的后面需要满足在他后面的点是自主排到nastya后面或者它可以被i吃掉。

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const double eps = 1e-;

const int maxn = 3e5 + ;

const int maxm = 5e5 + ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

int a[maxn];

int pos[maxn];

int pre[maxn];

struct Edge{

    int to,next;

}edge[maxm * ];

int head[maxn],tot;

void init(){

    for(int i =  ; i <= N ; i ++) head[i] = -;

    tot = ;

}

void add(int u,int v){

    edge[tot].to = v;

    edge[tot].next = head[u];

    head[u] = tot++;

}

int main(){

    Sca2(N,M); init();

    for(int i = ; i <= N ; i ++){

        a[i] = read();

        pos[a[i]] = i;

    }

    for(int i = ; i <= M ; i ++){

        PII e; e.fi = read(); e.se = read();

        if(pos[e.fi] < pos[e.se]){

            pre[pos[e.fi]]++;

            add(pos[e.se],pos[e.fi]);

        }

    }

    int ans = ,now = ;

    for(int i = N - ; i >= ; i --){

        if(pre[i] == now){

            ans++;

            for(int j = head[i]; ~j ; j = edge[j].next) pre[edge[j].to]--;

        }else{

            now++;

        }

    }

    Pri(ans);

    return ;

}

D

E.对k求一个前缀和pre,对于u点，属于[u,N]之间的所有点i的最小值都会满足 a[x] >= a[u] + pre[i] - pre[u]

对于i来说，pre[i]是固定的，动态更新的是a[u] - pre[u],所以将pre[i]分离出来，线段树维护每个点的a[u] - pre[u],维护区间和以及最大最小值。

求区间和的时候就是ppre[r] - ppre[l - 1] + 线段树维护的l到r之间的和。

坑点：lazy标记不能打成0，需要设为-INF,因为a[u] - pre[u]可能是负数

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

LL read(){LL x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const double eps = 1e-;

const int maxn = 1e5 + ;

const LL INF = 1e18;

const int mod = 1e9 + ;

int N,M,K;

struct Tree{

    int l,r;

    LL sum,MIN,MAX,lazy;

}tree[maxn << ];

LL a[maxn],pre[maxn],ppre[maxn];

void Pushup(int t){

    tree[t].sum = tree[t << ].sum + tree[t <<  | ].sum;

    tree[t].MIN = min(tree[t << ].MIN,tree[t <<  | ].MIN);

    tree[t].MAX = max(tree[t << ].MAX,tree[t <<  | ].MAX);

}

void Build(int t,int l,int r){

    tree[t].l = l; tree[t].r = r;

    tree[t].lazy = -INF;

    if(l == r){

        tree[t].MAX = tree[t].sum = tree[t].MIN = a[l] - pre[l];

        return;

    }

    int m = l + r >> ;

    Build(t << ,l,m); Build(t <<  | ,m + ,r);

    Pushup(t);

}

void change(int t,LL p){

    tree[t].lazy = max(p,tree[t].lazy);

    tree[t].sum = (tree[t].r - tree[t].l + ) * p;

    tree[t].MAX = tree[t].MIN = p;

}

void Pushdown(int t){

    if(tree[t].lazy != -INF){

        change(t << ,tree[t].lazy); change(t <<  | ,tree[t].lazy);

        tree[t].lazy = -INF;

    }

}

void update(int t,int l,int r,LL p){

    if(tree[t].MIN >= p) return;

    if(l <= tree[t].l && tree[t].r <= r && tree[t].MAX <= p){

        change(t,p);

        return;

    }

    Pushdown(t);

    int m = (tree[t].r + tree[t].l) >> ;

    if(r <= m) update(t << ,l,r,p);

    else if(l > m) update(t <<  | ,l,r,p);

    else{

         update(t << ,l,m,p);

         update(t <<  | ,m + ,r,p);

    }

    Pushup(t);

}

LL query(int t,int l,int r){

    if(l <= tree[t].l && tree[t].r <= r) return tree[t].sum;

    Pushdown(t);

    int m = (tree[t].l + tree[t].r) >> ;

    if(r <= m) return query(t << ,l,r);

    else if(l > m) return query(t <<  | ,l,r);

    else return query(t << ,l,m) + query(t <<  | ,m + ,r);

}

int main(){

    Sca(N);

    for(int i = ; i <= N ; i ++) a[i] = read();

    for(int i = ; i <= N; i ++){

        pre[i] = read() + pre[i - ];

        ppre[i] = pre[i] + ppre[i - ];

    }

    Build(,,N);

    int Q; Sca(Q);

    while(Q--){

        char op[]; int l,r;

        scanf("%s%d%d",&op,&l,&r);

        if(op[] == '+'){

            LL x = query(,l,l) + r + pre[l];

            update(,l,N,x - pre[l]);

        }else{

            Prl(query(,l,r) + ppre[r] - ppre[l - ]);

        }

    }

    return ;

}

E

codeforces-1136 (div2)的更多相关文章

  1. Codeforces #180 div2 C Parity Game

    // Codeforces #180 div2 C Parity Game // // 这个问题的意思被摄物体没有解释 // // 这个主题是如此的狠一点(对我来说,),不多说了这 // // 解决问 ...

  2. Codeforces #541 (Div2) - E. String Multiplication（动态规划）

    Problem   Codeforces #541 (Div2) - E. String Multiplication Time Limit: 2000 mSec Problem Descriptio ...

  3. Codeforces #541 (Div2) - F. Asya And Kittens（并查集+链表）

    Problem   Codeforces #541 (Div2) - F. Asya And Kittens Time Limit: 2000 mSec Problem Description Inp ...

  4. Codeforces #541 (Div2) - D. Gourmet choice（拓扑排序+并查集）

    Problem   Codeforces #541 (Div2) - D. Gourmet choice Time Limit: 2000 mSec Problem Description Input ...

  5. Codeforces #548 (Div2) - D.Steps to One（概率dp+数论）

    Problem   Codeforces #548 (Div2) - D.Steps to One Time Limit: 2000 mSec Problem Description Input Th ...

  6. 【Codeforces #312 div2 A】Lala Land and Apple Trees

    # [Codeforces #312 div2 A]Lala Land and Apple Trees 首先,此题的大意是在一条坐标轴上,有\(n\)个点,每个点的权值为\(a_{i}\),第一次从原 ...

  7. Codeforces 1136 - A/B/C/D/E - (Done)

    链接:https://codeforces.com/contest/1136/ A - Nastya Is Reading a Book - [二分] #include<bits/stdc++. ...

  8. Codeforces #263 div2 解题报告

    比赛链接:http://codeforces.com/contest/462 这次比赛的时候,刚刚注冊的时候非常想好好的做一下,可是网上喝了个小酒之后.也就迷迷糊糊地看了题目,做了几题.一觉醒来发现r ...

  9. codeforces #round363 div2.C-Vacations (DP)

    题目链接:http://codeforces.com/contest/699/problem/C dp[i][j]表示第i天做事情j所得到最小的假期,j=0,1,2. #include<bits ...

  10. codeforces round367 div2.C (DP)

    题目链接:http://codeforces.com/contest/706/problem/C #include<bits/stdc++.h> using namespace std; ...

随机推荐

  1. 设计模式系列之观察者模式(Observer Pattern)

    意图:定义对象间的一种一对多的依赖关系,当一个对象的状态发生改变时,所有依赖于它的对象都得到通知并被自动更新. 主要解决:一个对象状态改变给其他对象通知的问题,而且要考虑到易用和低耦合,保证高度的协作 ...

  2. C# 实体转为json字符串

    C# 实体转为json字符串 Catalog cata = new Catalog(); cata.C_platformid = 0; cata.C_isnav = 0; cata.C_isvalid ...

  3. SQL优化小技巧

    我们要做到不但会写SQL,还要做到写出性能优良的SQL语句. 1.使用表的别名(Alias): 当在SQL语句中连接多个表时, 请使用表的别名并把别名前缀于每个Column上.这样一来,就可以减少解析 ...

  4. 本地部署JAVA SE环境

    一.下载安装JDK: 下载地址:https://www.oracle.com/technetwork/java/javase/downloads/jdk8-doc-downloads-2133158. ...

  5. oracle知识点总结基础篇1

    最近学习了Oracle,对学习内容挑干的进行总结! 1.准备工作:学习Oracle首先就是安装环境.我装的是oracle11g. 2.安装完成之后在dos窗口中,输入  sqlplus 再输入用户名和 ...

  6. java基础-03基本语法

    关键词 常用关键字53个(含2个保留字): 1.保留关键字(2个) const --常量 常数:用于修改字段或局部变量的声明. goto--转到 指定跳转到标签,找到标签后,程序将处理从下一行开始的命 ...

  7. JEECG BOOT

    JEECGBOOT - 开源搜索 - 开源中国https://www.oschina.net/search?scope=blog&q=JEECGBOOT JEECG 基于代码生成器J2EE智能 ...

  8. NodeJs之word文件生成与解析

    NodeJs之word文件生成与解析 一,介绍与需求 1.1,介绍 1,officegen模块可以为Microsoft Office 2007及更高版本生成Office Open XML文件.此模块不 ...

  9. VS2013下载与安装

    1. 官网下载地址:  https://my.visualstudio.com/Downloads?q=visual studio 2013&wt.mc_id=o~msft~vscom~old ...

  10. 基于Redis实现分布式锁

    分布式锁具有的特性: 1.排他性: 文件系统: 数据库:主键 唯一约束 for update 性能较差,容易出现单点故障 锁没有失效时间,容易死锁 缓存Redis:setnx 实现复杂: 存在死锁(或 ...