A.维护一个前缀最大值，不断跳即可

#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 = 1e4 + ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

int a[maxn];

int Max[maxn];

int main(){

    Sca(N);

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

        Sca(a[i]);

        a[i] = max(a[i],a[i - ]);

    }

    int cnt = ;

    int now = ;

    while(now < N){

        cnt++;

        now++;

        while(now != a[now]) now = a[now];

    }

    Pri(cnt);

    return ;

}

A

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;

char str[maxn];

int main(){

    int T = read();

    while(T--){

        Sca(N);

        scanf("%s",str + );

        int ans = N - ;

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

            if(str[i] == '>'){

                ans = min(ans,i - );

                break;

            }

        }

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

            if(str[i] == '<'){

                ans = min(ans,N - i);

                break;

            }

        }

        Pri(ans);

    }

    return ;

}

B

C.按照beauty值从大到小排序，维护一个前缀和（最多K个length）,小根堆维护一下每次要踢出哪个最小lenght的弟弟

#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 INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

PLL P[maxn];

bool cmp(PLL a,PLL b){

    return a.se > b.se;

}

int main(){

    Sca2(N,K);

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

        scanf("%lld%lld",&P[i].fi,&P[i].se);

    }

    sort(P + ,P +  + N,cmp);

    priority_queue<LL,vector<LL>,greater<LL>>Q;

    LL sum = ;

    LL ans = ;

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

        ans = max(ans,(sum + P[i].fi) * P[i].se);

        Q.push(P[i].fi); sum += P[i].fi;

        if(Q.size() >= K){

            sum -= Q.top();

            Q.pop();

        }

    }

    Prl(ans);

    return ;

}

C

D.发现1,2,3| 1,3,4| 1,4,5 .. |1,n - 1,n为最优解。

#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 INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

int main(){

    Sca(N);

    LL sum = ;

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

        sum += i * (i + );

    }

    Prl(sum);

    return ;

}

D

E*

1.发现不存在奇长度的回文串只需要满足不存在长度3的回文串即可，长度为5的回文串包含了长度3的回文串。

2.也就是说，要满足所有的str[x] != str[x + 2],发现奇偶位置上的数字其实互不干扰，那可以把序列分成两个序列来做。

3.得到dp方程,dp[i][j]表示到了i这个位置，且这个位置上的数字为j的时候，满足条件序列的总数，状态转移方程为dp[i][j] = ∑dp[i - 1][p] (1 <= p <= K && p != j)

4.当然这个时间复杂度和空间复杂度双双nk的算法是行不通的，我们发现对于i相同的dp[i][j],只会有两种不同的值，并且是其中k - 1个值相同以及另一个值鹤立鸡群的情况（当然也有可能都是鸡完全相同）

5.考虑标注特殊的点位置和特殊的点值以及k - 1个其他的点值，即可压缩复杂度为O(n)

#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 = 2e5 + ;

const int INF = 0x3f3f3f3f;

const int mod = ;

int N,M,K;

LL a[maxn],b[maxn];

LL solve(LL *x,int n){

    LL big,small,pos;

    if(x[] == -){

        big = ; small = ; pos = ;

    }else{

        big = ; small = ; pos = x[];

    }

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

        if(x[i] == -){

            LL s = big * (K - ),b = big * (K - )  + small;

            small = s % mod; big = b % mod;

        }else{

            if(pos == x[i]){

                small = big * (K - ) % mod;

                big = ;

            }else{

                small = big * (K - ) + small; small %= mod;

                pos = x[i];

                big = ;

            }

        }

    }

    return (small + big * (K - )) % mod;

}

int main(){

    Sca2(N,K);

    int cnt1 = ,cnt2 = ;

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

        if(i & ) a[++cnt1] = read();

        else b[++cnt2] = read();

    }

    Prl(solve(a,cnt1) * solve(b,cnt2) % mod);

    return ;

}

E

F*

1.考虑将两个集合用一个二维的表来表示，添加就是将i行j列合并，最终答案是每个联通块的行数 * 列数。

2.考虑到用并查集,size1[maxn],size2[maxn],分别表示这个集合里面行列的数量。

3.问题在于删除，并查集是不存在在线直接删除这种黑科技的，但是我们可以用离线的方式，将并查集的存在生命周期放到线段树上，然后dfs整颗线段树进行优化。

这个操作在BZOJ2049里遇到过了，当时还写了blog https://www.cnblogs.com/Hugh-Locke/p/10367480.html

结果这次还是翻皮水了（雾）

#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 = 6e5 + ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

map<PII,int>P;

//并查集

int fa[maxn];

LL size1[maxn],size2[maxn];

int dep[maxn];

void init(){

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

        fa[i] = i;

        if(i > 3e5) size2[i] = ;

        else size1[i] = ;

        dep[i] = ;

    }

}

//线段树

struct Edge{

    PII to;

    int next;

}edge[maxn * ];

int tot;

void add(int& t,PII w){

    edge[tot].to = w;

    edge[tot].next = t;

    t = tot++;

}

struct Tree{

    int l,r;

    int head;

}tree[maxn << ];

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

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

    tree[t].head = -;

    if(l == r) return;

    int m = l + r >> ;

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

}

void add(int t,int l,int r,PII w){

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

        add(tree[t].head,w);

        return;

    }

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

    if(r <= m) add(t << ,l,r,w);

    else if(l > m) add(t <<  | ,l,r,w);

    else{

        add(t << ,l,m,w); add(t <<  | ,m + ,r,w);

    }

}

int Stack[maxn],top;

int find(int x){

    while(fa[x] != x) x = fa[x];

    return x;

}

LL ans;

void rewind(int t){

    while(top > t){

         int x = Stack[--top];

         dep[fa[x]] -= dep[x] + ;

         ans -= 1LL * size1[fa[x]] * size2[fa[x]];

         size1[fa[x]] -= size1[x];

         size2[fa[x]] -= size2[x];

         ans += 1LL * size1[fa[x]] * size2[fa[x]];

         ans += 1LL * size1[x] * size2[x];

         fa[x] = x;

    }

}

void dfs(int t){

    int now = top;

    for(int i = tree[t].head; ~i ; i = edge[i].next){

        PII t = edge[i].to;

        t.fi = find(t.fi); t.se = find(t.se);

        if(t.fi == t.se) continue;

        if(dep[t.fi] > dep[t.se]) swap(t.fi,t.se);

        Stack[top++] = t.fi;

        fa[t.fi] = t.se;

        dep[t.se] += dep[t.fi] + ;

        ans -= 1LL * size1[t.fi] * size2[t.fi]; ans -= size1[t.se] * size2[t.se];

        size1[t.se] += size1[t.fi]; size2[t.se] += size2[t.fi];

        ans += 1LL * size1[t.se] * size2[t.se];

    }

    if(tree[t].l == tree[t].r){

        printf("%lld ",ans);

    }else{

        dfs(t << );

        dfs(t <<  | );

    }

    rewind(now);

}

int main(){

    Sca(N); init();

    Build(,,N);

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

        PII p; p.fi = read(),p.se = read() + 3e5;

        if(P[p]){

            add(,P[p],i - ,p);

            P[p] = ;

        }else P[p] = i;

    }

    for(map<PII,int>::iterator it = P.begin(); it != P.end(); it++)  if((*it).se) add(,(*it).se,N,(*it).fi);

    dfs();

    return ;

}

F

codeforces-1140 (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 #263 div2 解题报告

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

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

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

  9. codeforces round367 div2.C (DP)

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

  10. codeforces 235 div2 C　Team

    题目:http://codeforces.com/contest/401/problem/C 题意:n个0,m个1,求没有00或111的情况. 这么简单的题..... 做题的时候脑残了...,今天,贴 ...

随机推荐

  1. Vue项目分环境打包的实现步骤

    转:https://blog.csdn.net/xinzi11243094/article/details/80521878 方法一:亲测真的有效 在项目开发中,我们的项目一般分为开发版.测试版.Pr ...

  2. idea怎么配置spring

    前提基础: 1.idea软件并JDK成功能用 2.有tacate,并会导入. 3.了解jsp和mvc基本结构 详细介绍: https://www.cnblogs.com/wormday/p/84356 ...

  3. (十)Modifying Your Data

    Elasticsearch provides data manipulation and search capabilities in near real time. By default, you ...

  4. 基于 HTML5 WebGL 的 3D 棉花加工监控系统

    前言 现在的棉花加工行业还停留在传统的反应式维护模式当中,当棉花加下厂的设备突然出现故障时,控制程序需要更换.这种情况下,首先需要客户向设备生产厂家请求派出技术人员进行维护,然后生产厂家才能根据情况再 ...

  5. 《构建之法》课程进度之Github、Travis等工具融入篇

    <构建之法>里有一个16周的软件工程课程进度设计.本文在该基本设计的基础上,围绕github.com(源码管理).travis-ci.org(持续集成).单元测试工具.日志工具.少数实用U ...

  6. React项目搭建与部署

    React项目搭建与部署 一,介绍与需求 1.1,介绍 1.1.1,React简介 React 是一个用于构建用户界面的 JAVASCRIPT 库. React主要用于构建UI,很多人认为 React ...

  7. React Native之支付集成(微信 支付宝)(ios android)

    React Native之支付集成(微信 支付宝)(ios android) 一,需求分析 1.1,app在线充值与提现 二,技术介绍与集成 2.1,微信支付 2.1.1,Android配置 详细配置 ...

  8. Google Closure Compiler高级压缩混淆Javascript代码

    一.背景 前端开发中,特别是移动端,Javascript代码压缩已经成为上线必备条件. 如今主流的Js代码压缩工具主要有: 1)Uglify http://lisperator.net/uglifyj ...

  9. 通过注解配置Bean

    之前说的三种配置方式,都是使用XML配置,现在我们说说使用注解配置Bean. 这部分内容主要分为两个部分:使用注解配置Bean,使用注解配置Bean属性. 在classpath中扫描组件 组件扫描:S ...

  10. thymeleaf循环

    th:each属性用于迭代循环,语法:th:each="obj,iterStat:${objList}"迭代对象可以是Java.util.List,java.util.Map,数组 ...