UVALive - 4726 Average

最新推荐文章于 2018-10-11 15:38:16 发布

Insist111

最新推荐文章于 2018-10-11 15:38:16 发布

阅读量237

点赞数 1

分类专栏：数形结合文章标签：数形结合

本文链接：https://blog.csdn.net/hhhhhh_12/article/details/77506575

版权

数形结合专栏收录该内容

1 篇文章 0 订阅

订阅专栏

UVALive - 4726

将字符串转化为数字，求前缀和sum，求的最大平均值可化为（sum[r]-sum[l-1]）/ (r-l+1), 即求最大斜率

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI 3.1415926
#define mod 1000000007
#define base 2333
using namespace std;
typedef long long LL;
const int inf = 1e9;
const int maxn = 1e5 + 10;
const int maxx = 5e6 + 10;
int t, n, m, sum[maxn], q[maxn];
char str[maxn];

double dis(int l, int r) {
    return (sum[r]-sum[l])*1.0/(r-l);
}

void solve() {
    scanf("%d", &t);
    while(t--) {
        scanf("%d%d%s", &n, &m, str+1);
        for(int i = 1; i <= n; i++)
            sum[i] = sum[i-1]+str[i]-'0';
        int fst = 0, bac = -1, len = m;
        int ll = 0, rr = m;
        double ans = dis(0, m);
        for(int i = m; i <= n; i++) {
            int aa = i-m;
            while(fst < bac && dis(q[bac], aa) <= dis(q[bac-1], aa))
                bac--;
            q[++bac] = aa;
            while(fst < bac && dis(q[fst], i) <= dis(q[fst+1], i))
                fst++;
            double bb = dis(q[fst], i);
            if(bb > ans) {
                ans = bb;
                ll = q[fst], rr = i;
                len = i-q[fst];
            }
            else if(bb == ans && len > i-q[fst]) {
                ll = q[fst], rr = i;
                len = i-q[fst];
            }
        }
        printf("%d %d\n", ll+1, rr);
    }
}

int main() {
    //srand(time(NULL));
    //freopen("perechi3.in","r",stdin);
    //freopen("perechi3.out","w",stdout);
    solve();
}