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. Eclipse 新建jsp文件报错问题

    今天在web工程中新建一个index.jsp文件时,发现会报错,记录一下解决办法. 原因:缺少servlet-api.jar包 所以我们先去下载一个jar包,将它引入我们的工程中,即可. 工程右键-& ...

  2. Asp.Net中virtual、override理解

    virtual关键字用于指定属性或方法在派生类中重写.默认情况下,派生类从其基类继承属性和方法,如果继承的属性或方法需要在派生类中有不同的行为,则可以重写它,即可以在派生类中定义该属性或方法的新实现, ...

  3. 《SQL CookBook 》笔记-第一章-检索记录

    目录 第一章 检索记录 1.1检索所有行和列 1.2筛选行 1.3查找满足多个查询条件的行 1.4筛选列 1.5创建列的别名 1.6 在where子句中引用别名列 1.7 串联多列的值 1.8 在se ...

  4. Linux - 微软无线鼠标滚动过快问题

    Linux - 微软无线鼠标滚动过快问题 使用了一段时间的 Manjaro , 感觉相当不错, 但有一个蛋疼的地方就是每次滚动鼠标滚轮, 都会切换一页以上的页面, 总是有一部分看不到. 之前以为是 L ...

  5. WSL(Windows Subsystem for Linux)--Pico Process Overview

    [转载] Windows Subsystem for Linux -- Pico Process Overview Overview This post discusses pico processe ...

  6. html&css学习笔记----YJZJZQA

    HTML表单: (

  7. Flink监控：Monitoring Apache Flink Applications

    This post originally appeared on the Apache Flink blog. It was reproduced here under the Apache Lice ...

  8. SQL MIN() 函数

    MIN() 函数 MIN 函数返回一列中的最小值.NULL 值不包括在计算中. SQL MIN() 语法 SELECT MIN(column_name) FROM table_name 注释:MIN ...

  9. python selenium while 循环

    while True: try: loadmore = browser.find_element_by_xpath('//div[@class="right"]/div[@clas ...

  10. 作业2：分布式版本控制系统Git的安装与使用

    1.下载安装配置用户名和邮箱. 2. 创建工作目录并通过git init命令把这个目录变成Git可以管理的仓库. 3. 在工作目录下准备文本文件,建议下载Notepad++代替记事本. 4. 组合用g ...