2015 多校第四场

一定要补上  o(╯□╰)o。。

5327 签到。。

/*Author :usedrose  */
/*Created Time :2015/7/31 22:36:32*/
/*File Name :2.cpp*/
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <vector>
#include <string>
#include <ctime>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define pi acos(-1.0)
#define MAXN 1110
#define OK cout << "ok" << endl;
#define o(a) cout << #a << " = " << a << endl
#define o1(a,b) cout << #a << " = " << a << "  " << #b << " = " << b << endl
using namespace std;
typedef long long LL;

bool is(int x)
{
    int a[10];
    memset(a, 0, sizeof(a));
    while (x) {
        int k = x%10;
        if (a[k]) return false;
        a[k]++;
        x /= 10;
    }
    return true;
}

int num[100010];

void init()
{
    for (int i = 1;i <= 100005; ++ i) {
        num[i] = num[i-1] + is(i);
    }
}

int main()
{
    //freopen("data.in","r",stdin);
    //freopen("data.out","w",stdout);
    cin.tie(0);
    ios::sync_with_stdio(false);
    init();
    int T;
    cin >> T;
    while (T--) {
        int l, r;
        cin >> l >> r;
        cout << num[r] - num[l-1] << endl;
    }
    return 0;
}

5328 再签一次。。

#include <stdio.h>
#include <algorithm>

#define MAXN 1000005

int a[MAXN];

inline void solve()
{
    int n;
    scanf("%d",&n);
    int i;
    for (i=1;i<=n;i++) {
        scanf("%d",a+i);
    }
    int ans=std::min(2,n);
    
    int l=1;
    for (i=3;i<=n;i++) {
        bool f= 2*a[i-1]==a[i-2]+a[i];
        if (!f) l=i-1;
        ans=std::max(ans,i-l+1);
    }
    
    l=1;
    for (i=3;i<=n;i++) {
        bool f= 1LL*a[i-1]*a[i-1]==1LL*a[i-2]*a[i];
        if (!f) l=i-1;
        ans=std::max(ans,i-l+1);
    }
    
    printf("%d
",ans);
}

int main()
{
    int T;
    scanf("%d",&T);
    int i;
    for (i=1;i<=T;i++) {
        solve();
    }
}

hdu5335

主要是贪心..

/*Author :usedrose  */
/*Created Time :2015/8/1 9:29:16*/
/*File Name :2.cpp*/
#pragma comment(linker, "/STACK:1024000000,1024000000") 
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <vector>
#include <string>
#include <ctime>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define pi acos(-1.0)
#define MAXN 1110
#define OK cout << "ok" << endl;
#define o(a) cout << #a << " = " << a << endl
#define o1(a,b) cout << #a << " = " << a << "  " << #b << " = " << b << endl
using namespace std;
typedef long long LL;

int T, n, m, tx[4] = {0, 0, 1, -1}, ty[4] = {1, -1, 0, 0};
char S[1100][1100];
bool used[1100][1100];
int xx[1100000], yy[1100000];

void bfs()
{
    memset(used, false, sizeof(used));
    used[1][1] = true;
    int q = 1, h = 1;
    xx[q] = yy[q] = 1;
    for (;q <= h; ++ q) 
        if (S[xx[q]][yy[q]] == '0') {
            for (int i = 0;i < 4; ++ i) {
                int X = xx[q] + tx[i];
                int Y = yy[q] + ty[i];
                if (X > 0 && X <= n && Y > 0 && Y <= m && !used[X][Y]) {
                    h++;
                    xx[h] = X;
                    yy[h] = Y;
                    used[X][Y] = true;
                }
            }        
        }
        if (used[n][m] && S[n][m] == '0') {
            puts("0");
            return;
        }
    int ma = 0;
    for (int i = 1;i <= n; ++ i)
        for (int j = 1;j <= m; ++ j)
            if (used[i][j])
                ma = max(ma, i + j);
    printf("1");
    for (int i = ma; i < n+m; ++ i) {
        char mi = '1';
        for (int j = 1;j <= n; ++ j) 
            if (1 <= i - j && i-j <= m && used[j][i-j]) {
                mi = min(mi, S[j+1][i-j]);
                mi = min(mi, S[j][i-j+1]);
            }
        printf("%c", mi);
        for (int j = 1;j <= n; ++ j)
            if (1 <= i - j && i -j <= m && used[j][i-j]) {
                if (S[j+1][i-j] == mi) used[j+1][i-j] = true;
                if (S[j][i-j+1] == mi) used[j][i-j+1] = true;
            }
    }
    puts("");
}

int main()
{
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d", &n, &m);
        for (int i = 1;i <= n; ++ i)
            scanf("%s", S[i]+1);
        for (int i = 0;i <= n+1; ++ i) 
            S[i][0] = '2', S[i][m+1] = '2';
        for (int i = 0;i <= m + 1; ++ i)
            S[0][i] = '2', S[n+1][i] = '2';
        bfs();
    }
    return 0;
}