Codeforces Round #492 (Div. 2)

最新推荐文章于 2025-08-01 11:12:48 发布

转载最新推荐文章于 2025-08-01 11:12:48 发布 · 71 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/luoyibujue/p/9290979.html

本文提供了三道算法题目的解答及实现思路，包括硬币找零问题、路口通行策略优化和序列调整问题，通过C++代码展示了如何用贪心算法等方法解决实际问题。

/*
从大往小依次除
*/

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<set>
#include<map>
#define M
#define ll long long

using namespace std;
int read() {
    int nm = 0, f = 1;
    char c = getchar();
    for(; !isdigit(c); c = getchar()) if(c == '-') f = -1;
    for(; isdigit(c); c = getchar()) nm = nm * 10 + c - '0';
    return nm * f;
}
int main() {
    int n = read(), ans = 0;
    ans += n / 100;
    n %= 100;
    ans += n / 20;
    n %= 20;
    ans += n / 10;
    n %= 10;
    ans += n / 5;
    n %= 5;
    ans += n;
    cout << ans;

    return 0;
}

/*
发现每个路口何时进去是能算出来的   所以O1扫一遍即可 


*/


#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<set>
#include<map>
#define M 100010 
#define ll long long

using namespace std;
int read() {
    int nm = 0, f = 1;
    char c = getchar();
    for(; !isdigit(c); c = getchar()) if(c == '-') f = -1;
    for(; isdigit(c); c = getchar()) nm = nm * 10 + c - '0';
    return nm * f;
}

int note[M]; 

int main() {
    int n = read(), id, minn = 0x3e3e3e3e;
    for(int i = 1; i <= n; i++)
    {
        note[i] = read();
        int op = note[i] - i + 1;
        int zz = (op + n - 1) / n;
        if(zz < minn) minn = zz, id = i;
    }
    cout << id;
    return 0;
}

/*
贪心的写法  每次 选择最靠左的一个不连续的  将右边的贪心移动过来 



*/


#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<set>
#include<map>
#define M
#define ll long long

using namespace std;
int read() {
    int nm = 0, f = 1;
    char c = getchar();
    for(; !isdigit(c); c = getchar()) if(c == '-') f = -1;
    for(; isdigit(c); c = getchar()) nm = nm * 10 + c - '0';
    return nm * f;
}



int main() {
    


    return 0;
}

转载于:https://www.cnblogs.com/luoyibujue/p/9290979.html